0% found this document useful (0 votes)
49 views3 pages

China Training

This document appears to be notes from a math training session held from 6:15-7:15 PM at Tsinghua University in Beijing. It contains 26 math problems or exercises without full explanations. The high-level topics covered include geometry, number theory, sequences, inequalities, and other abstract algebra/analysis concepts.
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
49 views3 pages

China Training

This document appears to be notes from a math training session held from 6:15-7:15 PM at Tsinghua University in Beijing. It contains 26 math problems or exercises without full explanations. The high-level topics covered include geometry, number theory, sequences, inequalities, and other abstract algebra/analysis concepts.
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 3

2005 China IMO Team positive numbers a1 , a2 ,...

, an , select k
Training numbers and multiply each time.
6.15-7.15, Tsinghua University, The k power root of the average of all
Beijing these multiples, is called Ak .
1. Given quadrangle ABCD, its
inscribe quadrangle EFGH is a a1a2 ...ak + a1a3 ...ak +1 + ...
parallelogram. Intersect AE’=AE, + an −k +1...an −1an 1

BF’=BF, CG’=DG, DH’=AH. Prove: Ak = ( ) k


.
Cnk
(1) E’F’G’H’ is also a parallelogram.
(2) EFGH and E’F’G’H’ have the Prove: if 1 ≤ k1 < k2 ≤ n, Ak1 ≥ Ak2 .
same area. 9. If every vertex of polygon V is on
2. Given E,F midpoints of sides the border of polygon W, we call V a
AB,BC of triangle ABC. CM,BN are inscribed polygon of W. Prove: For
heights on side AB, AC. Join EF,MN each convex polygon W with unit
and intersect at point P. Suppose O,H area, there exists a non-trivial
are circumcenter and orthocenter central-symmetry inscribed convex
respectively. Join AP,OH. Prove: hexagon V, such that the area of V is
AP ⊥ OH . 2
3. Given E,F two points in ∠AOB , not less than .
3
such that ∠AOE = ∠ BOF . Construct a
10. Given n ≥ 2 , for n-element set
perpendicular from E,F to OB at
E2 , F2 . Join E1 E2 , F1 F2 , they intersect A = {a1 , a2 ,..., an }, B = {b1 , b2 ,..., bn } of
complex numbers, prove the
at point P. Prove: OP ⊥ EF .
following inequality:
4. Given M the midpoint of side BC of n n
equilateral triangle ABC, construct
semicircle with M the center, tangent n ∏ (ak + b j ) n ∏ (b k + aj )
to the two equal sides. Join ∑ j =1
n
=∑ j =1
n
.
perpendiculars of two equal sides k =1
∏ (a k − aj ) k =1
∏ (b k − bj )
passing E,F, intersect at P. Pass P j =1 j =1
j ≠k j ≠k
construct PQ ⊥ BC at Q. Prove:
11. Find all polynomials f ( x) with
AP : PQ = 2 AB : BC.
integer coefficients, such that for
5. In right-angled triangle ABC,
any positive integer n , f ( n) | 2n − 1.
∠B = 90o. Its inscribe circle tangent
sides BC,CA,AB at points D,E,F. Join 12. Let n, k be non-positive integers,
AD, intersect the inscribe circle at a is a positive integer. Let
another point P. Join PC,PE,PF. Given n+k +x n+x k+x x
f ( x) = [ ]−[ ]−[ ] + [ ],
PC ⊥ PF , prove: PE / / BC. a a a a
6. Find all pairs of relatively prime prove: for any non-positive integer m
integers ( x, y ) , such that , f (0) + f (1) + ... + f (m ) ≥ 0.
x | y 2 + 210, y | x2 + 210. 13. There are n bus routes in a city,
7. (1) Find all positive integers k , such that
(1) Any station passes no more than
such that equation a 2 + b 2 + c 2 = kabc
3 routes.
has positive integral root (a, b, c) . (2) Any route has no less than two
(2) Prove, for each k mentioned stations.
above, the equation have infinite (3) For any given two routes, one can
such positive integral roots (an , bn , cn ) find a third route, such that
passenger can from any one of the
that in three numbers an , bn , cn , every given two routes, pass the third
two of them can be presented as route you find, and turn to the other
sum of two perfect squares. one.
8. From arbitrary n(n ≥ 2) given
5 x2 n = ax2 n −1 − x2 n −2 , x2 n +1 = bx2 n − x2n −1 , n ≥ 1.
Prove: There are at least (n − 5)
6 Prove: for any positive integers m, n ,
routes. multiple xn + m ⋅ xn + m −1 ⋅⋅⋅ xn +1 can be
14. Given set A of real numbers,
divided exactly by multiple
integer n ≥ 2,| A |< n , and 20 , 21 ,..., 2n−1 xm ⋅ xm −1 ⋅⋅⋅ x1 .
can be presented as sum of some
22. In convex quadrangle ABCD,
different elements of A. Prove there
exists negative number in A. AB<AD, ∠ABC = ∠ADC = 90o , points
15. Let g ( x) ∈ Z [ x ], g ( x) has no non- E,G are on side BC (E is between B
and G), F is on side DC, such that
negative root. Prove: there exist
AB BE EG
h( x) ∈ Z [ x ] , such that the = = . Prove: AG, BF , DE
coefficients of g ( x)h( x) are all
AD DF FC
are concurrent.
positive. 23. The password of any safe is an
16. Sequence of sets { An }{Bn } is integer from 1 to 1700. Two
defined below: A1 = ∅, B1 = {0}, detectives know a password each,
they meet at the side of a river.
An +1 = {x + 1| x ∈ Bn }, Along the side are 26 stones. First,
Bn +1 = ( An ∪ Bn ) \ ( An ∩ Bn ). detective A throw some of the stones
into the water, then B throw some
Find all positive integers n ,such that
stones, then A, then B again, until
Bn = {0}. the stones are thrown up. They leave
17. Let { An = (an , bn )} be vectors without any word. Please design a
possible method for them to
whose component is integer. Prove:
exchange information in the way
there exists a positive integer N ,
mentioned.
such that for any component An ,
24. Let a1 , a2 ,..., ak be k different
there are always N integers positive integers, they all have none
N
square factors (not including 1).
kn ,1 , kn ,2 ,..., kn , N such that An = ∑ kn ,i Ai .
Then for any non-zero rational
i =1
numbers b1 , b2 ,..., bn , we have
18. Relatively prime integers pn , qn
k

satisfy
pn 1 1 1
= 1 + + + ... + . Find all ∑b i ai ≠ 0.
qn 2 3 n i =1

25. Sequence {xn }n ≥1 is defined as


positive integers n , such that 3 | pn .
19. Find all positive real numbers a , 1
follows: x1 = 1, x2 n = 1 + xn , x2 n +1 = .
such that for any positive real x2 n
numbers t1 , t2 , t3 , t4 satisfying t1t 2t3t4 = a
4
Prove: for any positive rational
, number r , there exists only n , such
1 1 1 1 4 that r = xn .
+ + + ≤ . 26. Prove that for any positive
1 + t1 1 + t2 1 + t3 1 + t4 1+ a
integer k > 1 , one can find a power of
20. Let n be a positive integer, n ≥ 3 , 2, where there are at least half of the
p is a prime. Prove: last k digits are 9.
f ( x) = x n + p 2 x n −1 + ... + p2 x + p2 is 27. Each edge of a graph is colored
irreducible in Z [ x ] . with one of 4 colors, such that for
every route of 3 edges, the first and
21. Suppose positive integers a, b > 1 , the third edges are in different
sequence {xn } is defined below: colors. (The first and the last vertex
x0 = 0, x1 = 1, can be the same.) Prove: one can
color all the vertices of the graph
with 4 colors, such that any two
vertices connected with an edge, are
in different colors.

You might also like