olymmath

CGMO 2020

China Girls' Mathematical Olympiad 2020.

Other problems

Problem 1

In the quadrilateral ABCDABCD , AB=ADAB=AD , CB=CDCB=CD , ∠ABC=90∘\angle ABC =90^\circ . EE , FF are on ABAB , ADAD and PP , QQ are on EFEF ( PP is between E,QE, Q ), satisfy AEEP=AFFQ\frac{AE}{EP}=\frac{AF}{FQ} . X,YX, Y are on CP,CQCP, CQ that satisfy BX⊥CP,DY⊥CQBX \perp CP, DY \perp CQ . Prove that X,P,Q,YX, P, Q, Y are concyclic.

Attachments:

T1.jpg

Problem 2

Let nn be an integer and n≥2n \geq 2 , x1,x2,⋯ ,xnx_1, x_2, \cdots , x_n are arbitrary real number, find the maximum value of 2∑1≤i<j≤n⌊xixj⌋−(n−1)∑i=1n⌊xi2⌋2\sum_{1\leq i<j \leq n}\left \lfloor x_ix_j \right \rfloor-\left ( n-1 \right )\sum_{i=1}^{n}\left \lfloor x_i^2 \right \rfloor

Problem 3

There are 33 classes with nn students in each class, and the heights of all 3n3n students are pairwise distinct. Partition the students into groups of 33 such that in each group, there is one student from each class. In each group, call the tallest student the tall guy. Suppose that for any partition of the students, there are at least 10 tall guys in each class, prove that the minimum value of nn is 4040 .

Problem 4

Let p,qp,q be primes, where p>qp>q . Define t=gcd⁡(p!−1,q!−1)t=\gcd(p!-1,q!-1) . Prove that t≤pp3t\le p^{\frac{p}{3}} .

Problem 5

Find all the real number sequences {bn}n≥1\{b_n\}_{n \geq 1} and {cn}n≥1\{c_n\}_{n \geq 1} that satisfy the following conditions: (i) For any positive integer nn , bn≤cnb_n \leq c_n ; (ii) For any positive integer nn , bn+1b_{n+1} and cn+1c_{n+1} is the two roots of the equation x2+bnx+cn=0x^2+b_nx+c_n=0 .

Problem 6

Let p,qp, q be integers and p,q>1p, q > 1 , gcd(p,6q)=1gcd(p, 6q)=1 . Prove that: ∑k=1q−1⌊pkq⌋2≡2p∑k=1q−1k⌊pkq⌋(modq−1)\sum_{k=1}^{q-1}\left \lfloor \frac{pk}{q}\right\rfloor^2 \equiv 2p \sum_{k=1}^{q-1}k\left\lfloor \frac{pk}{q} \right\rfloor (mod q-1)

Problem 8

Let nn be a given positive integer. Let N+\mathbb{N}_+ denote the set of all positive integers.

Determine the number of all finite lists (a1,a2,⋯ ,am)(a_1,a_2,\cdots,a_m) such that:(1) m∈N+m\in \mathbb{N}_+ and a1,a2,⋯ ,am∈N+a_1,a_2,\cdots,a_m\in \mathbb{N}_+ and a1+a2+⋯+am=na_1+a_2+\cdots+a_m=n .(2) The number of all pairs of integers (i,j)(i,j) satisfying 1≤i<j≤m1\leq i<j\leq m and ai>aja_i>a_j is even.

For example, when n=4n=4 , the number of all such lists (a1,a2,⋯ ,am)(a_1,a_2,\cdots,a_m) is 66 , and these lists are (4),(4), (1,3),(1,3), (2,2),(2,2), (1,1,2),(1,1,2), (2,1,1),(2,1,1), (1,1,1,1)(1,1,1,1) .