Subcontests
(12)Putnam 2011 B6
Let p be an odd prime. Show that for at least (p+1)/2 values of n in {0,1,2,…,p−1},
\sum_{k=0}^{p-1}k!n^k \text{is not divisible by }p. Putnam 2011 B5
Let a1,a2,… be real numbers. Suppose there is a constant A such that for all n,
∫−∞∞(i=1∑n1+(x−ai)21)2dx≤An.
Prove there is a constant B>0 such that for all n,
i,j=1∑n(1+(ai−aj)2)≥Bn3. Putnam 2011 B4
In a tournament, 2011 players meet 2011 times to play a multiplayer game. Every game is played by all 2011 players together and ends with each of the players either winning or losing. The standings are kept in two 2011×2011 matrices, T=(Thk) and W=(Whk). Initially, T=W=0. After every game, for every (h,k) (including for h=k), if players h and k tied (that is, both won or both lost), the entry Thk is increased by 1, while if player h won and player k lost, the entry Whk is increased by 1 and Wkh is decreased by 1.Prove that at the end of the tournament, det(T+iW) is a non-negative integer divisible by 22010. Putnam 2011 A6
Let G be an abelian group with n elements, and let {g1=e,g2,…,gk}⊊G be a (not necessarily minimal) set of distinct generators of G. A special die, which randomly selects one of the elements g1,g2,…,gk with equal probability, is rolled m times and the selected elements are multiplied to produce an element g∈G.Prove that there exists a real number b∈(0,1) such that m→∞limb2m1x∈G∑(Prob(g=x)−n1)2 is positive and finite. Putnam 2011 A5
Let F:R2→R and g:R→R be twice continuously differentiable functions with the following properties:• F(u,u)=0 for every u∈R;• for every x∈R,g(x)>0 and x2g(x)≤1;• for every (u,v)∈R2, the vector ∇F(u,v) is either 0 or parallel to the vector ⟨g(u),−g(v)⟩.Prove that there exists a constant C such that for every n≥2 and any x1,…,xn+1∈R, we have
i=jmin∣F(xi,xj)∣≤nC. Putnam 2011 A2
Let a1,a2,… and b1,b2,… be sequences of positive real numbers such that a1=b1=1 and bn=bn−1an−2 for n=2,3,…. Assume that the sequence (bj) is bounded. Prove that S=n=1∑∞a1⋯an1 converges, and evaluate S. Putnam 2011 A1
Define a growing spiral in the plane to be a sequence of points with integer coordinates P0=(0,0),P1,…,Pn such that n≥2 and:• The directed line segments P0P1,P1P2,…,Pn−1Pn are in successive coordinate directions east (for P0P1), north, west, south, east, etc.• The lengths of these line segments are positive and strictly increasing.\begin{picture}(200,180)\put(20,100){\line(1,0){160}}
\put(100,10){\line(0,1){170}}\put(0,97){West}
\put(180,97){East}
\put(90,0){South}
\put(90,180){North}\put(100,100){\circle{1}}\put(100,100){\circle{2}}\put(100,100){\circle{3}}
\put(115,100){\circle{1}}\put(115,100){\circle{2}}\put(115,100){\circle{3}}
\put(115,130){\circle{1}}\put(115,130){\circle{2}}\put(115,130){\circle{3}}
\put(40,130){\circle{1}}\put(40,130){\circle{2}}\put(40,130){\circle{3}}
\put(40,20){\circle{1}}\put(40,20){\circle{2}}\put(40,20){\circle{3}}
\put(170,20){\circle{1}}\put(170,20){\circle{2}}\put(170,20){\circle{3}}\multiput(100,99.5)(0,.5){3}{\line(1,0){15}}
\multiput(114.5,100)(.5,0){3}{\line(0,1){30}}
\multiput(40,129.5)(0,.5){3}{\line(1,0){75}}
\multiput(39.5,20)(.5,0){3}{\line(0,1){110}}
\multiput(40,19.5)(0,.5){3}{\line(1,0){130}}\put(102,90){P0}
\put(117,90){P1}
\put(117,132){P2}
\put(28,132){P3}
\put(30,10){P4}
\put(172,10){P5}\end{picture}
How many of the points (x,y) with integer coordinates 0≤x≤2011,0≤y≤2011 cannot be the last point, Pn, of any growing spiral?