olymmath

US-TST 2011

USA IMO Team Selection Test 2011.

Other problems

Problem 1

In an acute scalene triangle ABCABC , points D,E,FD,E,F lie on sides BC,CA,ABBC, CA, AB , respectively, such that AD⊥BC,BE⊥CA,CF⊥ABAD \perp BC, BE \perp CA, CF \perp AB . Altitudes AD,BE,CFAD, BE, CF meet at orthocenter HH . Points PP and QQ lie on segment EFEF such that AP⊥EFAP \perp EF and HQ⊥EFHQ \perp EF . Lines DPDP and QHQH intersect at point RR . Compute HQ/HRHQ/HR .

Proposed by Zuming Feng

Problem 2

In the nation of Onewaynia, certain pairs of cities are connected by roads. Every road connects exactly two cities (roads are allowed to cross each other, e.g., via bridges). Some roads have a traffic capacity of 1 unit and other roads have a traffic capacity of 2 units. However, on every road, traffic is only allowed to travel in one direction. It is known that for every city, the sum of the capacities of the roads connected to it is always odd. The transportation minister needs to assign a direction to every road. Prove that he can do it in such a way that for every city, the difference between the sum of the capacities of roads entering the city and the sum of the capacities of roads leaving the city is always exactly one.

Proposed by Zuming Feng and Yufei Zhao

Problem 3

Let pp be a prime. We say that a sequence of integers {zn}n=0∞\{z_n\}_{n=0}^\infty is a pp -pod if for each e≥0e \geq 0 , there is an N≥0N \geq 0 such that whenever m≥Nm \geq N , pep^e divides the sum ∑k=0m(−1)k(mk)zk.\sum_{k=0}^m (-1)^k {m \choose k} z_k. Prove that if both sequences {xn}n=0∞\{x_n\}_{n=0}^\infty and {yn}n=0∞\{y_n\}_{n=0}^\infty are pp -pods, then the sequence {xnyn}n=0∞\{x_ny_n\}_{n=0}^\infty is a pp -pod.

Problem 4

Find a real number tt such that for any set of 120 points P1,…P120P_1, \ldots P_{120} on the boundary of a unit square, there exists a point QQ on this boundary with ∣P1Q∣+∣P2Q∣+⋯+∣P120Q∣=t|P_1Q| + |P_2Q| + \cdots + |P_{120}Q| = t .

Problem 5

Let cnc_n be a sequence which is defined recursively as follows: c0=1c_0 = 1 , c2n+1=cnc_{2n+1} = c_n for n≥0n \geq 0 , and c2n=cn+cn−2ec_{2n} = c_n + c_{n-2^e} for n>0n > 0 where ee is the maximal nonnegative integer such that 2e2^e divides nn . Prove that ∑i=02n−1ci=1n+2(2n+2n+1).\sum_{i=0}^{2^n-1} c_i = \frac{1}{n+2} {2n+2 \choose n+1}.

Problem 6

A polynomial P(x)P(x) is called nice if P(0)=1P(0) = 1 and the nonzero coefficients of P(x)P(x) alternate between 11 and −1-1 when written in order. Suppose that P(x)P(x) is nice, and let mm and nn be two relatively prime positive integers. Show that Q(x)=P(xn)⋅(xmn−1)(x−1)(xm−1)(xn−1)Q(x) = P(x^n) \cdot \frac{(x^{mn} - 1)(x-1)}{(x^m-1)(x^n-1)} is nice as well.

Problem 7

Let ABCABC be an acute scalene triangle inscribed in circle Ω\Omega . Circle ω\omega , centered at OO , passes through BB and CC and intersects sides ABAB and ACAC at EE and DD , respectively. Point PP lies on major arc BACBAC of Ω\Omega . Prove that lines BD,CE,OPBD, CE, OP are concurrent if and only if triangles PBDPBD and PCEPCE have the same incenter.

Problem 8

Let n≥1n \geq 1 be an integer, and let SS be a set of integer pairs (a,b)(a,b) with 1≤a<b≤2n1 \leq a < b \leq 2^n . Assume ∣S∣>n⋅2n+1|S| > n \cdot 2^{n+1} . Prove that there exists four integers a<b<c<da < b < c < d such that SS contains all three pairs (a,c)(a,c) , (b,d)(b,d) and (a,d)(a,d) .

Problem 9

Determine whether or not there exist two different sets A,BA,B , each consisting of at most 201122011^2 positive integers, such that every xx with 0<x<10 < x < 1 satisfies the following inequality: ∣∑a∈Axa−∑b∈Bxb∣<(1−x)2011.\left| \sum_{a \in A} x^a - \sum_{b \in B} x^b \right| < (1-x)^{2011}.