olymmath

CMO 1995

Chinese Mathematical Olympiad 1995.

Day 1

Problem 1

  • Day 1

Let a1,a2,⋯ ,an;b1,b2,⋯ ,bn(n≥3)a_1,a_2,\cdots ,a_n; b_1,b_2,\cdots ,b_n (n\ge 3) be real numbers satisfying the following conditions: (1) a1+a2+⋯+an=b1+b2+⋯+bna_1+a_2+\cdots +a_n= b_1+b_2+\cdots +b_n ; (2) 0<a1=a2,ai+ai+1=ai+20<a_1=a_2, a_i+a_{i+1}=a_{i+2} ( i=1,2,⋯ ,n−2i=1,2,\cdots ,n-2 ); (3) 0<b1≤b2,bi+bi+1≤bi+20<b_1\le b_2, b_i+b_{i+1}\le b_{i+2} ( i=1,2,⋯ ,n−2i=1,2,\cdots ,n-2 ). Prove that an−1+an≤bn−1+bna_{n-1}+a_n\le b_{n-1}+b_n .

Answer, solutions and source

Problem 2

  • Day 1

Let f:N→Nf: \mathbb{N} \rightarrow \mathbb{N} be a function satisfying the following conditions: (1) f(1)=1f(1)=1 ; (2) ∀n∈N\forall n\in \mathbb{N} , 3f(n)f(2n+1)=f(2n)(1+3f(n))3f(n) f(2n+1) =f(2n) ( 1+3f(n) ) ; (3) ∀n∈N\forall n\in \mathbb{N} , f(2n)<6f(n)f(2n) < 6 f(n) . Find all solutions of equation f(k)+f(l)=293f(k) +f(l)=293 , where k<lk<l . ( N\mathbb{N} denotes the set of all natural numbers).

Answer, solutions and source

Problem 3

  • Day 1

Find the minimun value of ∑i=110∑j=110∑k=110∣k(x+y−10i)(3x−6y−36j)(19x+95y−95k)∣\sum_{i=1}^{10} \sum_{j=1}^{10} \sum_{k=1}^{10}|k(x+y-10i)(3x-6y-36j)(19x+95y-95k)| , where x,yx,y are integers.

Answer, solutions and source

Day 2

Problem 4

  • Day 2

Given four spheres with their radii equal to 2,2,3,32,2,3,3 respectively, each sphere externally touches the other spheres. Suppose that there is another sphere that is externally tangent to all those four spheres, determine the radius of this sphere.

Answer, solutions and source

Problem 5

  • Day 2

Let a1,a2,⋯ ,a10a_1,a_2,\cdots ,a_{10} be pairwise distinct natural numbers with their sum equal to 1995. Find the minimal value of a1a2+a2a3+⋯+a9a10+a10a1a_1a_2+a_2a_3+\cdots +a_9a_{10}+a_{10}a_1 .

Answer, solutions and source

Problem 6

  • Day 2

Let n(n>1)n(n>1) be an odd. We define xk=(x1(k),x2(k),⋯ ,xn(k))x_k=(x^{(k)}_1,x^{(k)}_2,\cdots ,x^{(k)}_n) as follow: x0=(x1(0),x2(0),⋯ ,xn(0))=(1,0,⋯ ,0,1)x_0=(x^{(0)}_1,x^{(0)}_2,\cdots ,x^{(0)}_n)=(1,0,\cdots ,0,1) ; xi(k)={0,xi(k−1)=xi+1(k−1),1,xi(k−1)≠xi+1(k−1),x^{(k)}_i =\begin{cases}0, x^{(k-1)}_i=x^{(k-1)}_{i+1}, 1, x^{(k-1)}_i\not= x^{(k-1)}_{i+1},\end{cases} i=1,2,⋯ ,ni=1,2,\cdots ,n , where xn+1(k−1)=x1(k−1)x^{(k-1)}_{n+1}= x^{(k-1)}_1 . Let mm be a positive integer satisfying x0=xmx_0=x_m . Prove that mm is divisible by nn .

Answer, solutions and source