olymmath

US-TST 2006

USA IMO Team Selection Test 2006.

Other problems

Problem 1

A communications network consisting of some terminals is called a 33 -connector if among any three terminals, some two of them can directly communicate with each other. A communications network contains a windmill with nn blades if there exist nn pairs of terminals {x1,y1},{x2,y2},…,{xn,yn}\{x_{1},y_{1}\},\{x_{2},y_{2}\},\ldots,\{x_{n},y_{n}\} such that each xix_{i} can directly communicate with the corresponding yiy_{i} and there is a hub terminal that can directly communicate with each of the 2n2n terminals x1,y1,…,xn,ynx_{1}, y_{1},\ldots,x_{n}, y_{n} . Determine the minimum value of f(n)f (n) , in terms of nn , such that a 33 -connector with f(n)f (n) terminals always contains a windmill with nn blades.

Problem 2

In acute triangle ABCABC , segments AD;BEAD; BE , and CFCF are its altitudes, and HH is its orthocenter. Circle ω\omega , centered at OO , passes through AA and HH and intersects sides ABAB and ACAC again at QQ and PP (other than AA ), respectively. The circumcircle of triangle OPQOPQ is tangent to segment BCBC at RR . Prove that CRBR=EDFD.\frac{CR}{BR}=\frac{ED}{FD}.

Problem 3

Find the least real number kk with the following property: if the real numbers xx , yy , and zz are not all positive, then k(x2−x+1)(y2−y+1)(z2−z+1)≥(xyz)2−xyz+1.k(x^{2}-x+1)(y^{2}-y+1)(z^{2}-z+1)\geq (xyz)^{2}-xyz+1.

Problem 4

Let nn be a positive integer. Find, with proof, the least positive integer dnd_{n} which cannot be expressed in the form ∑i=1n(−1)ai2bi,\sum_{i=1}^{n}(-1)^{a_{i}}2^{b_{i}}, where aia_{i} and bib_{i} are nonnegative integers for each i.i.

Problem 5

Let nn be a given integer with nn greater than 77 , and let P\mathcal{P} be a convex polygon with nn sides. Any set of n−3n-3 diagonals of P\mathcal{P} that do not intersect in the interior of the polygon determine a triangulation of P\mathcal{P} into n−2n-2 triangles. A triangle in the triangulation of P\mathcal{P} is an interior triangle if all of its sides are diagonals of P\mathcal{P} . Express, in terms of nn , the number of triangulations of P\mathcal{P} with exactly two interior triangles, in closed form.

Problem 6

Let ABCABC be a triangle. Triangles PABPAB and QACQAC are constructed outside of triangle ABCABC such that AP=ABAP = AB and AQ=ACAQ = AC and ∠BAP=∠CAQ\angle{BAP}= \angle{CAQ} . Segments BQBQ and CPCP meet at RR . Let OO be the circumcenter of triangle BCRBCR . Prove that AO⊥PQ.AO \perp PQ.