olymmath

CMO 2018

Chinese Mathematical Olympiad 2018.

Day 1

Problem 1

  • Day 1

Let nn be a positive integer. Let AnA_n denote the set of primes pp such that there exists positive integers a,ba,b satisfying a+bp and an+bnp2\frac{a+b}{p} \text{ and } \frac{a^n + b^n}{p^2} are both integers that are relatively prime to pp . If AnA_n is finite, let f(n)f(n) denote ∣An∣|A_n| .

a) Prove that AnA_n is finite if and only if n≠2n \not = 2 .

b) Let m,km,k be odd positive integers and let dd be their gcd. Show that f(d)≤f(k)+f(m)−f(km)≤2f(d).f(d) \leq f(k) + f(m) - f(km) \leq 2 f(d).

Answer, solutions and source

Problem 2

  • Day 1

Let nn and kk be positive integers and let T={(x,y,z)∈N3∣1≤x,y,z≤n}T = \{ (x,y,z) \in \mathbb{N}^3 \mid 1 \leq x,y,z \leq n \} be the length nn lattice cube. Suppose that 3n2−3n+1+k3n^2 - 3n + 1 + k points of TT are colored red such that if PP and QQ are red points and PQPQ is parallel to one of the coordinate axes, then the whole line segment PQPQ consists of only red points.

Prove that there exists at least kk unit cubes of length 11 , all of whose vertices are colored red.

Answer, solutions and source

Problem 3

  • Day 1

Let qq be a positive integer which is not a perfect cube. Prove that there exists a positive constant CC such that for all natural numbers nn , one has {nq13}+{nq23}≥Cn−12\{ nq^{\frac{1}{3}} \} + \{ nq^{\frac{2}{3}} \} \geq Cn^{-\frac{1}{2}} where {x}\{ x \} denotes the fractional part of xx .

Answer, solutions and source

Day 2

Problem 4

  • Day 2

ABCDABCD is a cyclic quadrilateral whose diagonals intersect at PP . The circumcircle of △APD\triangle APD meets segment ABAB at points AA and EE . The circumcircle of △BPC\triangle BPC meets segment ABAB at points BB and FF . Let II and JJ be the incenters of △ADE\triangle ADE and △BCF\triangle BCF , respectively. Segments IJIJ and ACAC meet at KK . Prove that the points A,I,K,EA,I,K,E are cyclic.

Answer, solutions and source

Problem 5

  • Day 2

Let n≥3n \geq 3 be an odd number and suppose that each square in a n×nn \times n chessboard is colored either black or white. Two squares are considered adjacent if they are of the same color and share a common vertex and two squares a,ba,b are considered connected if there exists a sequence of squares c1,…,ckc_1,\ldots,c_k with c1=a,ck=bc_1 = a, c_k = b such that ci,ci+1c_i, c_{i+1} are adjacent for i=1,2,…,k−1i=1,2,\ldots,k-1 .

Find the maximal number MM such that there exists a coloring admitting MM pairwise disconnected squares.

Answer, solutions and source

Problem 6

  • Day 2

China Mathematical Olympiad 2018 Q6 Given the positive integer n,kn ,k (n>k)(n>k) and a1,a2,⋯ ,an∈(k−1,k)a_1,a_2,\cdots ,a_n\in (k-1,k) ,if positive number x1,x2,⋯ ,xnx_1,x_2,\cdots ,x_n satisfying:For any set I⊆{1,2,⋯ ,n}\mathbb{I} \subseteq \{1,2,\cdots,n\} , ∣I∣=k|\mathbb{I} |=k ,have ∑i∈Ixi≤∑i∈Iai\sum_{i\in \mathbb{I} }x_i\le \sum_{i\in \mathbb{I} }a_i , find the maximum value of x1x2⋯xn.x_1x_2\cdots x_n. Attachments:

sqing.jpg

Answer, solutions and source