Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 39 views

    International Competitions IMO Shortlist 1972 17

    Uploaded by

    nick142857
    The document contains 10 math problems from the 1972 International Mathematical Olympiad shortlist. The problems cover a range of topics including geometry, number theory, inequalities, and sequences.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd

    International Competitions IMO Shortlist 1972 17

    Uploaded by

    nick142857
    39 views2 pages
    The document contains 10 math problems from the 1972 International Mathematical Olympiad shortlist. The problems cover a range of topics including geometry, number theory, inequalities, and sequences.

    Original Description:

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document contains 10 math problems from the 1972 International Mathematical Olympiad shortlist. The problems cover a range of topics including geometry, number theory, inequalities, and sequences.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    39 views2 pages

    International Competitions IMO Shortlist 1972 17

    Uploaded by

    nick142857
    The document contains 10 math problems from the 1972 International Mathematical Olympiad shortlist. The problems cover a range of topics including geometry, number theory, inequalities, and sequences.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    IMO Shortlist 1972

    1 f and g are real-valued functions dened on the real line. For all x and y, f (x+y)+f (xy) = 2f (x)g(y). f is not identically zero and |f (x)| 1 for all x. Prove that |g(x)| 1 for all x. 2 We are given 3n points A1,A2, . . . , A3n in the plane, no three of them collinear. Prove that one can construct n disjoint triangles with vertices at the points Ai. 3 The least number is m and the greatest number is M among a1 , a2 , . . . , an satisfying a1 + a2 + ... + an = 0. Prove that a2 + + a2 nmM 1 n 4 Let n1 , n2 be positive integers. Consider in a plane E two disjoint sets of points M1 and M2 consisting of 2n1 and 2n2 points, respectively, and such that no three points of the union M1 M2 are collinear. Prove that there exists a straightline g with the following property: Each of the two half-planes determined by g on E (g not being included in either) contains exactly half of the points of M1 and exactly half of the points of M2 . 5 Prove the following assertion: The four altitudes of a tetrahedron ABCD intersect in a point if and only if AB 2 + CD2 = BC 2 + AD2 = CA2 + BD2 . 6 Show that for any n 0 (mod 10) there exists a multiple of n not containing the digit 0 in its decimal expansion. 7 Given four distinct parallel planes, prove that there exists a regular tetrahedron with a vertex on each plane. 8 Prove that (2m)!(2n)! is a multiple of m!n!(m + n)! for any non-negative integers m and n. 9 Find all positive real solutions to: (x2 x3 x5 )(x2 x3 x5 ) 0(x2 x4 x1 )(x2 x4 x1 ) 1 2 2 3 2 2 2 2 0(x3 x5 x2 )(x4 x5 x2 ) 0(x4 x1 x3 )(x5 x1 x3 ) 0(x2 x2 x4 )(x2 x2 x4 ) 0 5 1

    (0) Given n > 4, prove that every cyclic quadrilateral can be dissected into n cyclic quadrilaterals.

    This le was downloaded from the AoPS Math Olympiad Resources Page http://www.artofproblemsolving.com/

    Page 1

    IMO Shortlist 1972

    Consider a sequence of circles K1 , K2 , K3 , K4 , . . . of radii r1 , r2 , r3 , r4 , . . . , respectively, situated inside a triangle ABC. The circle K1 is tangent to AB and AC; K2 is tangent to K1 , BA, and BC; K3 is tangent to K2 , CA, and CB; K4 is tangent to K3 , AB, and AC; etc. (a) Prove the relation 1 1 1 1 r1 cot A + 2 r1 r2 + r2 cot B = r cot A + cot B 2 2 2 2 where r is the radius of the incircle of the triangle ABC. Deduce the existence of a t1 such that 1 1 r1 = r cot B cot C sin2 t1 2 2 (b) Prove that the sequence of circles K1 , K2 , . . . is periodic. Prove that from a set of ten distinct two-digit numbers, it is always possible to nd two disjoint subsets whose members have the same sum.

    This le was downloaded from the AoPS Math Olympiad Resources Page http://www.artofproblemsolving.com/

    Page 2

    You might also like