olymmath

US-TST 2007

USA IMO Team Selection Test 2007.

Other problems

Problem 1

Circles ω1\omega_1 and ω2\omega_2 meet at PP and QQ . Segments ACAC and BDBD are chords of ω1\omega_1 and ω2\omega_2 respectively, such that segment ABAB and ray CDCD meet at PP . Ray BDBD and segment ACAC meet at XX . Point YY lies on ω1\omega_1 such that PY∥BDPY \parallel BD . Point ZZ lies on ω2\omega_2 such that PZ∥ACPZ \parallel AC . Prove that points Q,X,Y,ZQ,X,Y,Z are collinear.

Problem 2

Let nn be a positive integer and let a1≤a2≤⋯≤ana_1 \le a_2 \le \dots \le a_n and b1≤b2≤⋯≤bnb_1 \le b_2 \le \dots \le b_n be two nondecreasing sequences of real numbers such that a1+⋯+ai≤b1+⋯+bi for every i=1,…,na_1 + \dots + a_i \le b_1 + \dots + b_i \text{ for every } i = 1, \dots, n and a1+⋯+an=b1+⋯+bn.a_1 + \dots + a_n = b_1 + \dots + b_n. Suppose that for every real number mm , the number of pairs (i,j)(i,j) with ai−aj=ma_i-a_j=m equals the numbers of pairs (k,ℓ)(k,\ell) with bk−bℓ=mb_k-b_\ell = m . Prove that ai=bia_i = b_i for i=1,…,ni=1,\dots,n .

Problem 3

Let θ\theta be an angle in the interval (0,π/2)(0,\pi/2) . Given that cos⁡θ\cos \theta is irrational, and that cos⁡kθ\cos k \theta and cos⁡[(k+1)θ]\cos[(k + 1)\theta ] are both rational for some positive integer kk , show that θ=π/6\theta = \pi/6 .

Problem 4

Determine whether or not there exist positive integers aa and bb such that aa does not divide bn−nb^n - n for all positive integers nn .

Problem 5

Triangle ABCABC is inscribed in circle ω\omega . The tangent lines to ω\omega at BB and CC meet at TT . Point SS lies on ray BCBC such that AS⊥ATAS \perp AT . Points B1B_1 and C1C_1 lie on ray STST (with C1C_1 in between B1B_1 and SS ) such that B1T=BT=C1TB_1T = BT = C_1T . Prove that triangles ABCABC and AB1C1AB_1C_1 are similar to each other.

Problem 6

For a polynomial P(x)P(x) with integer coefficients, r(2i−1)r(2i - 1) (for i=1,2,3,…,512i = 1,2,3,\ldots,512 ) is the remainder obtained when P(2i−1)P(2i - 1) is divided by 10241024 . The sequence (r(1),r(3),…,r(1023))(r(1),r(3),\ldots,r(1023)) is called the remainder sequence of P(x)P(x) . A remainder sequence is called complete if it is a permutation of (1,3,5,…,1023)(1,3,5,\ldots,1023) . Prove that there are no more than 2352^{35} different complete remainder sequences.