olymmath

US-TST 2004

USA IMO Team Selection Test 2004.

Other problems

Problem 1

Suppose a1,a2,…,ana_1, a_2, \ldots, a_n and b1,b2,…,bnb_1, b_2, \ldots, b_n are real numbers such that (a12+a22+⋯+an2−1)(b12+b22+⋯+bn2−1)>(a1b1+a2b2+⋯+anbn−1)2.(a_1 ^ 2 + a_2 ^ 2 + \cdots + a_n ^ 2 -1)(b_1 ^ 2 + b_2 ^ 2 + \cdots + b_n ^ 2 - 1) > (a_1 b_1 + a_2 b_2 + \cdots + a_n b_n - 1)^2. Prove that a12+a22+⋯+an2>1a_1 ^ 2 + a_2 ^ 2 + \cdots + a_n ^ 2 > 1 and b12+b22+⋯+bn2>1b_1 ^ 2 + b_2 ^ 2 + \cdots + b_n ^ 2 > 1 .

Problem 2

Assume nn is a positive integer. Considers sequences a0,a1,…,ana_0, a_1, \ldots, a_n for which ai∈{1,2,…,n}a_i \in \{1, 2, \ldots , n\} for all ii and an=a0a_n = a_0 .

(a) Suppose nn is odd. Find the number of such sequences if ai−ai−1≢i(modn)a_i - a_{i-1} \not \equiv i \pmod{n} for all i=1,2,…,ni = 1, 2, \ldots, n .

(b) Suppose nn is an odd prime. Find the number of such sequences if ai−ai−1≢i,2i(modn)a_i - a_{i-1} \not \equiv i, 2i \pmod{n} for all i=1,2,…,ni = 1, 2, \ldots, n .

Problem 3

Draw a 2004×20042004 \times 2004 array of points. What is the largest integer nn for which it is possible to draw a convex nn -gon whose vertices are chosen from the points in the array?

Problem 4

Let ABCABC be a triangle. Choose a point DD in its interior. Let ω1\omega_1 be a circle passing through BB and DD and ω2\omega_2 be a circle passing through CC and DD so that the other point of intersection of the two circles lies on ADAD . Let ω1\omega_1 and ω2\omega_2 intersect side BCBC at EE and FF , respectively. Denote by XX the intersection of DFDF , ABAB and YY the intersection of DE,ACDE, AC . Show that XY∥BCXY \parallel BC .

Problem 5

Let A=(0,0,0)A = (0, 0, 0) in 3D space. Define the weight of a point as the sum of the absolute values of the coordinates. Call a point a primitive lattice point if all of its coordinates are integers whose gcd is 1. Let square ABCDABCD be an unbalanced primitive integer square if it has integer side length and also, BB and DD are primitive lattice points with different weights. Prove that there are infinitely many unbalanced primitive integer squares such that the planes containing the squares are not parallel to each other.

Problem 6

Define the function f:N∪{0}→Qf: \mathbb N \cup \{0\} \to \mathbb{Q} as follows: f(0)=0f(0) = 0 and f(3n+k)=−3f(n)2+k,f(3n+k) = -\frac{3f(n)}{2} + k , for k=0,1,2k = 0, 1, 2 . Show that ff is one-to-one and determine the range of ff .