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

Welcome to Scribd!

  • 117 views

    Chinese IMO Team Selection Test 2005: March 31, 2005 4.5 Hours

    Uploaded by

    ryszard_lubicz
    This document contains information about a Chinese IMO team selection test that took place over two days in March and April 2005. It lists 6 problems that were part of the test. The problems cover topics in geometry, number theory, complex analysis, and combinatorics. The goal of the test was to select team members to represent China at the International Mathematical Olympiad.

    Copyright:

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

    Chinese IMO Team Selection Test 2005: March 31, 2005 4.5 Hours

    Uploaded by

    ryszard_lubicz
    117 views1 page
    This document contains information about a Chinese IMO team selection test that took place over two days in March and April 2005. It lists 6 problems that were part of the test. The problems cover topics in geometry, number theory, complex analysis, and combinatorics. The goal of the test was to select team members to represent China at the International Mathematical Olympiad.

    Original Description:

    cmo

    Original Title

    Cmo Tst 2005

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains information about a Chinese IMO team selection test that took place over two days in March and April 2005. It lists 6 problems that were part of the test. The problems cover topics in geometry, number theory, complex analysis, and combinatorics. The goal of the test was to select team members to represent China at the International Mathematical Olympiad.

    Copyright:

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

    Chinese IMO Team Selection Test 2005: March 31, 2005 4.5 Hours

    Uploaded by

    ryszard_lubicz
    This document contains information about a Chinese IMO team selection test that took place over two days in March and April 2005. It lists 6 problems that were part of the test. The problems cover topics in geometry, number theory, complex analysis, and combinatorics. The goal of the test was to select team members to represent China at the International Mathematical Olympiad.

    Copyright:

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

    Chinese IMO Team Selection Test 2005

    Day I
    March 31, 2005

    4.5 hours

    1. Convex quadrilateral ABCD is cyclic in circle (O), P is the intersection of the diagonals AC and
    BD. Circle (O1) passes through P and B, circle (O2) passes through P and A, Circles (O1) and
    (O2) intersect at P and Q. ( O1), ( O2) intersect ( O) at another points E, F (besides B, A),
    respectively. Prove that PQ, CE, DF are concurrent or parallel.

    2. Given positive integer n (n 2), find the largest positive integer m satisfying :
    For n bags, if every bag contains some balls whose weights are all integer powers of 2 (the
    weights of balls in a bag may not be distinct), and the total weights of balls in every bag are
    equal, then there exists a weight among these balls such that the total number of balls with this
    weight is at least m.

    3. n is a positive integers, and aj ( j =1


    ,2,,n) are complex numbers. Suppose for arbitrary
    nonempty subset I of{
    1,2,,n}, the inequality

    (1 a

    ) 1

    jI

    1
    always holds. Prove
    2

    that

    | a
    j
    1

    | 3.

    Day II
    April 1, 2005

    4.5 hours

    4. Let a1, a2,,a6; b1, b2,,b6 and c1, c2,,c6 are all permutations of 1,2,,6, respectively.
    6

    Find the minimum value of

    a b c
    i
    1

    i i i

    5. Let n be a given positive integer, and x be a positive real number. Prove that
    n

    x x ( x 1) x 1
    n, where [x] denotes the largest integer no larger than x.


    k
    1

    6. Let a be given positive real number, find all the functions f: N+ R such that f(k + m) = f(k) +
    f(m) holds for any positive integers k, m satisfying am k (a + 1)m.

    You might also like