[go: up one dir, main page]
Scribd
Upload
148 views3 pages

2001 Imo Training Camp: Contributors: Complexphi, Agr 94 Math, Omid Hatami

Uploaded by

Abhishek Singh

The document summarizes the problems presented each day of the 2001 International Mathematical Olympiad (IMO) Training Camp. Over five days, problems covered topics like inequalities in triangles, properties of polynomials, number theory, coloring grids, and properties of circles. The training camp exposed participants to a variety of challenging mathematical problems to help prepare them for the international competition.

Copyright:

© All Rights Reserved
Download as PDF, TXT or read online from Scribd
Download as pdf or txt

2001 Imo Training Camp: Contributors: Complexphi, Agr 94 Math, Omid Hatami

Uploaded by

Abhishek Singh
148 views3 pages
The document summarizes the problems presented each day of the 2001 International Mathematical Olympiad (IMO) Training Camp. Over five days, problems covered topics like inequalities in triangles, properties of polynomials, number theory, coloring grids, and properties of circles. The training camp exposed participants to a variety of challenging mathematical problems to help prepare them for the international competition.

Original Description:

THE IMO Training Camp India

Original Title

IMOTC

Copyright

© © All Rights Reserved

Available Formats

PDF, TXT or read online from Scribd

Did you find this document useful?

Is this content inappropriate?

The document summarizes the problems presented each day of the 2001 International Mathematical Olympiad (IMO) Training Camp. Over five days, problems covered topics like inequalities in triangles, properties of polynomials, number theory, coloring grids, and properties of circles. The training camp exposed participants to a variety of challenging mathematical problems to help prepare them for the international competition.

Copyright:

© All Rights Reserved
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
148 views3 pages

2001 Imo Training Camp: Contributors: Complexphi, Agr 94 Math, Omid Hatami

Uploaded by

Abhishek Singh
The document summarizes the problems presented each day of the 2001 International Mathematical Olympiad (IMO) Training Camp. Over five days, problems covered topics like inequalities in triangles, properties of polynomials, number theory, coloring grids, and properties of circles. The training camp exposed participants to a variety of challenging mathematical problems to help prepare them for the international competition.

Copyright:

© All Rights Reserved
Download as PDF, TXT or read online from Scribd
Download as pdf or txt
You are on page 1/ 3

2001 IMO Training Camp

International Mathematical Olympiad Training Camp 2001

Day 1
1

Let x , y , z > 0. Prove that if xyz xy + yz + zx, then xyz 3(x + y + z).

Two symbols A and B obey the rule ABBB = B. Given a word x1 x2 . . . x3n+1
consisting of n letters A and 2n + 1 letters B, show that there is a unique cyclic
permutation of this word which reduces to B.

In a triangle ABC with incircle and incenter I , the segments AI , BI , CI


cut at D , E , F , respectively. Rays AI , BI , CI meet the sides BC , CA
, AB at L , M , N respectively. Prove that:
AL + BM + CN 3(AD + BE + CF )
When does equality occur?

Day 2
1

For any positive integer n, show that there exists a polynomial P (x) of degree
n with integer coefficients such that P (0), P (1), . . . , P (n) are all distinct powers
of 2.

Let Q(x) be a cubic polynomial with integer coefficients. Suppose that a prime
p divides Q(xj ) for j = 1 ,2 ,3 ,4 , where x1 , x2 , x3 , x4 are distinct integers from
the set {0, 1, , p 1}. Prove that p divides all the coefficients of Q(x).

Find the number of all unordered pairs {A, B} of subsets of an 8-element set,
such that A B 6= and |A| =
6 |B|.

Day 3
1

If on ABC, trinagles AEB and AF C are constructed externally such that


AEB = 2, AF B = 2. AE = EB, AF = F C.
COnstructed externally on BC is triangle BDC with DBC = , BCD = .
Prove that 1. DA is perpendicular to EF .
DT
2. If T is the projection of D on BC, then prove that DA
EF = 2 BC .

www.artofproblemsolving.com/community/c4996
Contributors: ComplexPhi, Agr 94 Math, Omid Hatami

2001 IMO Training Camp

Find all functions f : R+ R+ satisfying :

f (f (x) x) = 2x
for all x > 0.
Points B = B1 , B2 , , Bn , Bn+1 = C are chosen on side BC of a triangle ABC
in that order. Let rj be the inradius of triangle ABj Bj+1 for j = 1, , n , and
r be the inradius of ABC. Show that there is a constant independent of n
such that :
( r1 )( r2 ) ( rn ) = n1 ( r)

Day 4
Complex numbers , , have the property that k + k + k is an integer
for every natural number k. Prove that the polynomial

(x )(x )(x )
has integer coefficients.
Let p > 3 be a prime. For each k {1, 2, . . . , p 1}, define xk to be the unique
integer in {1, . . . , p 1} such that kxk 1 (mod p) and set kxk = 1 + pnk .
Prove that :
p1
X
p1
(mod p)
knk
2

k=1

Each vertex of an m n grid is colored blue, green or red in such a way that all
the boundary vertices are red. We say that a unit square of the grid is properly
colored if: (i) all the three colors occur at the vertices of the square, and (ii)
one side of the square has the endpoints of the same color.
Show that the number of properly colored squares is even.

Day 5
1

Let ABCD be a rectangle, and let be a circular arc passing through the
points A and C.
Let 1 be the circle tangent to the lines CD and DA and to the circle , and
lying completely inside the rectangle ABCD.
Similiarly let 2 be the circle tangent to the lines AB and BC and to the circle
www.artofproblemsolving.com/community/c4996
Contributors: ComplexPhi, Agr 94 Math, Omid Hatami

2001 IMO Training Camp

, and lying completely inside the rectangle ABCD.


Denote by r1 and r2 the radii of the circles 1 and 2 , respectively, and by r
the inradius of triangle ABC.
(a) Prove that r1 + r2 = 2r.
(b) Prove that one of the two common internal tangents of the two circles 1
and 2 is parallel to the line AC and has the length |AB AC|.
2

A strictly increasing sequence (an ) has the property that gcd(am , an ) = agcd(m,n)
for all m, n N. Suppose k is the least positive integer for which there exist
positive integers r < k < s such that a2k = ar as . Prove that r|k and k|s.

Let P (x) be a polynomial of degree n with real coefficients and let a 3. Prove
that


max aj P (j) 1
0jn+1

www.artofproblemsolving.com/community/c4996
Contributors: ComplexPhi, Agr 94 Math, Omid Hatami

You might also like