Let S be a set with 2002 elements and P the set of all its subsets. Prove that for any n (in the range from zero to |P|) we can color n elements of P white, and the rest black, so that the union of any two elements of P with the same color has the same color.
Let ABC be a triangle such that
(cot2A)2+(2cot2B)2+(3cot2C)2=(7r6s)2,
where s and r denote its semiperimeter and its inradius, respectively. Prove that triangle ABC is similar to a triangle T whose side lengths are all positive integers with no common divisors and determine these integers.
Prove that any monic polynomial (a polynomial with leading coefficient 1) of degree n with real coefficients is the average of two monic polynomials of degree n with n real roots.
Show that we can link any two integers m, n greater than 2 by a chain of positive integers m = a1, a2, ... , ak+1 = n, so that the product of any two consecutive members of the chain is divisible by their sum. [For example, 7, 42, 21, 28, 70, 30, 6, 3 links 7 and 3.]
I have an n×n sheet of stamps, from which I've been asked to tear out blocks of three adjacent stamps in a single row or column. (I can only tear along the perforations separating adjacent stamps, and each block must come out of the sheet in one piece.) Let b(n) be the smallest number of blocks I can tear out and make it impossible to tear out any more blocks. Prove that there are real constants c and d such that 71n2−cn≤b(n)≤51n2+dn for all n>0 .