Subcontests
(12)Putnam 2010 B6
Let A be an n×n matrix of real numbers for some n≥1. For each positive integer k, let A[k] be the matrix obtained by raising each entry to the kth power. Show that if Ak=A[k] for k=1,2,⋯,n+1, then Ak=A[k] for all k≥1. Putnam 2010 B3
There are 2010 boxes labeled B1,B2,…,B2010, and 2010n balls have been distributed among them, for some positive integer n. You may redistribute the balls by a sequence of moves, each of which consists of choosing an i and moving exactly i balls from box Bi into any one other box. For which values of n is it possible to reach the distribution with exactly n balls in each box, regardless of the initial distribution of balls? Putnam 2010 B2
Given that A,B, and C are noncollinear points in the plane with integer coordinates such that the distances AB,AC, and BC are integers, what is the smallest possible value of AB? Putnam 2010 A5
Let G be a group, with operation ∗. Suppose that(i) G is a subset of R3 (but ∗ need not be related to addition of vectors);(ii) For each a,b∈G, either a×b=a∗b or a×b=0 (or both), where × is the usual cross product in R3.Prove that a×b=0 for all a,b∈G. Putnam 2010 A3
Suppose that the function h:R2→R has continuous partial derivatives and satisfies the equation
h(x,y)=a∂x∂h(x,y)+b∂y∂h(x,y)
for some constants a,b. Prove that if there is a constant M such that ∣h(x,y)∣≤M for all (x,y) in R2, then h is identically zero. Putnam 2010 A1
Given a positive integer n, what is the largest k such that the numbers 1,2,…,n can be put into k boxes so that the sum of the numbers in each box is the same?[When n=8, the example {1,2,3,6},{4,8},{5,7} shows that the largest k is at least 3.]