olymmath

CMO 2014

Chinese Mathematical Olympiad 2014.

Day 1

Problem 1

  • Day 1

Let ABCABC be a triangle with AB>ACAB>AC . Let DD be the foot of the internal angle bisector of AA . Points FF and EE are on AC,ABAC,AB respectively such that B,C,F,EB,C,F,E are concyclic. Prove that the circumcentre of DEFDEF is the incentre of ABCABC if and only if BE+CF=BCBE+CF=BC .

Answer, solutions and source

Problem 2

  • Day 1

For the integer n>1n>1 , define D(n)={a−b∣ab=n,a>b>0,a,b∈N}D(n)=\{ a-b\mid ab=n, a>b>0, a,b\in\mathbb{N} \} . Prove that for any integer k>1k>1 , there exists pairwise distinct positive integers n1,n2,…,nkn_1,n_2,\ldots,n_k such that n1,…,nk>1n_1,\ldots,n_k>1 and ∣D(n1)∩D(n2)∩⋯∩D(nk)∣≥2|D(n_1)\cap D(n_2)\cap\cdots\cap D(n_k)|\geq 2 .

Answer, solutions and source

Problem 3

  • Day 1

Prove that: there exists only one function f:N∗→N∗f:\mathbb{N^*}\to\mathbb{N^*} satisfying: i) f(1)=f(2)=1f(1)=f(2)=1 ; ii) f(n)=f(f(n−1))+f(n−f(n−1))f(n)=f(f(n-1))+f(n-f(n-1)) for n≥3n\ge 3 . For each integer m≥2m\ge 2 , find the value of f(2m)f(2^m) .

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Let n=p1a1p2a2⋯ptatn=p_1^{a_1}p_2^{a_2}\cdots p_t^{a_t} be the prime factorisation of nn . Define ω(n)=t\omega(n)=t and Ω(n)=a1+a2+…+at\Omega(n)=a_1+a_2+\ldots+a_t . Prove or disprove: For any fixed positive integer kk and positive reals α,β\alpha,\beta , there exists a positive integer n>1n>1 such that i) ω(n+k)ω(n)>α\frac{\omega(n+k)}{\omega(n)}>\alpha ii) Ω(n+k)Ω(n)<β\frac{\Omega(n+k)}{\Omega(n)}<\beta .

Answer, solutions and source

Problem 5

  • Day 2

Let f:X→Xf:X\rightarrow X , where X={1,2,…,100}X=\{1,2,\ldots ,100\} , be a function satisfying:

  1. f(x)≠xf(x)\neq x for all x=1,2,…,100x=1,2,\ldots,100 ;
  2. for any subset AA of XX such that ∣A∣=40|A|=40 , we have A∩f(A)≠∅A\cap f(A)\neq\emptyset . Find the minimum kk such that for any such function ff , there exist a subset BB of XX , where ∣B∣=k|B|=k , such that B∪f(B)=XB\cup f(B)=X .

Answer, solutions and source

Problem 6

  • Day 2

For non-empty number sets S,TS, T , define the sets S+T={s+t∣s∈S,t∈T}S+T=\{s+t\mid s\in S, t\in T\} and 2S={2s∣s∈S}2S=\{2s\mid s\in S\} . Let nn be a positive integer, and A,BA, B be two non-empty subsets of {1,2…,n}\{1,2\ldots,n\} . Show that there exists a subset DD of A+BA+B such that

  1. D+D⊆2(A+B)D+D\subseteq 2(A+B) ,
  2. ∣D∣≥∣A∣⋅∣B∣2n|D|\geq\frac{|A|\cdot|B|}{2n} , where ∣X∣|X| is the number of elements of the finite set XX .

Answer, solutions and source