olymmath

Putnam 1990

William Lowell Putnam Mathematical Competition 1990.

Session A

A1

  • Session A

Let T0=2,T1=3,T2=6,T_0 = 2, T_1 = 3, T_2 = 6, and for n≥3n \geq 3, Tn=(n+4)Tn−1−4nTn−2+(4n−8)Tn−3.T_n = (n+4)T_{n-1} - 4n T_{n-2} + (4n-8) T_{n-3}. The first few terms are 2,3,6,14,40,152,784,5168,40576.2, 3, 6, 14, 40, 152, 784, 5168, 40576. Find, with proof, a formula for TnT_n of the form Tn=An+BnT_n = A_n + B_n, where {An}\{A_n\} and {Bn}\{B_n\} are well-known sequences.

Answer, solutions and source

A2

  • Session A

Is 2\sqrt{2} the limit of a sequence of numbers of the form n3−m3\sqrt[3]{n} - \sqrt[3]{m} (n,m=0,1,2,…n,m = 0, 1, 2, \dots)?

Answer, solutions and source

A3

  • Session A

Prove that any convex pentagon whose vertices (no three of which are collinear) have integer coordinates must have area greater than or equal to 5/2.

Answer, solutions and source

A4

  • Session A

Consider a paper punch that can be centered at any point of the plane and that, when operated, removes from the plane precisely those points whose distance from the center is irrational. How many punches are needed to remove every point?

Answer, solutions and source

A5

  • Session A

If A\mathbf{A} and B\mathbf{B} are square matrices of the same size such that ABAB=0\mathbf{ABAB = 0}, does it follow that BABA=0\mathbf{BABA = 0}?

Answer, solutions and source

A6

  • Session A

If XX is a finite set, let XX denote the number of elements in XX. Call an ordered pair (S,T)(S, T) of subsets of {1,2,…,n}\{1, 2, \dots, n\} admissible if s>∣T∣s > |T| for each s∈Ss \in S, and t>∣S∣t > |S| for each t∈Tt \in T. How many admissible ordered pairs of subsets of {1,2,…,10}\{1, 2, \dots, 10\} are there? Prove your answer.

Answer, solutions and source

Session B

B1

  • Session B

Find all real-valued continuously differentiable functions ff on the real line such that for all xx, (f(x))2=∫0x[(f(t))2+(f′(t))2]dt+1990.(f(x))^2 = \int_0^x [(f(t))^2 + (f'(t))^2] dt + 1990.

Answer, solutions and source

B2

  • Session B

Prove that for ∣x∣<1|x| < 1, ∣z∣>1|z| > 1, 1+∑j=1∞(1+xj)Pj=0,1 + \sum_{j=1}^\infty (1 + x^j)P_j = 0, where PjP_j is (1−z)(1−zx)(1−zx2)⋯(1−zxj−1)(z−x)(z−x2)(z−x3)⋯(z−xj).\frac{(1 - z)(1 - zx)(1 - zx^2) \cdots (1 - zx^{j-1})} {(z - x)(z - x^2)(z - x^3) \cdots (z - x^j)}.

Answer, solutions and source

B3

  • Session B

Let SS be a set of 2×22 \times 2 integer matrices whose entries aija_{ij} (1) are all squares of integers and, (2) satisfy aij≤200a_{ij} \leq 200. Show that if SS has more than 50387 (=154−152−15+2= 15^4 - 15^2 - 15 + 2) elements, then it has two elements that commute.

Answer, solutions and source

B4

  • Session B

Let GG be a finite group of order nn generated by aa and bb. Prove or disprove: there is a sequence g1,g2,g3,…,g2ng_1, g_2, g_3, \dots, g_{2n} such that

(1) every element of GG occurs exactly twice, and

(2) gi+1g_{i+1} equals giag_i a or gibg_i b for i=1,2,…,2ni = 1, 2, \dots, 2n. (Interpret g2n+1g_{2n+1} as g1g_1.)

Answer, solutions and source

B5

  • Session B

Is there an infinite sequence a0,a1,a2,…a_0, a_1, a_2, \dots of nonzero real numbers such that for n=1,2,3,…n = 1, 2, 3, \dots the polynomial pn(x)=a0+a1x+a2x2+⋯+anxnp_n(x) = a_0 + a_1x + a_2x^2 + \cdots + a_nx^n has exactly nn distinct real roots?

Answer, solutions and source

B6

  • Session B

Let SS be a nonempty closed bounded convex set in the plane. Let KK be a line and tt a positive number. Let L1L_1 and L2L_2 be support lines for SS parallel to K1K_1, and let L‾\overline{L} be the line parallel to KK and midway between L1L_1 and L2L_2. Let BS(K,t)B_S(K, t) be the band of points whose distance from L‾\overline{L} is at most (t/2)w(t/2)w, where ww is the distance between L1L_1 and L2L_2. What is the smallest tt such that S∩⋂KBS(K,t)≠∅S \cap \bigcap_K B_S(K, t) \neq \emptyset for all SS? (KK runs over all lines in the plane.)

Answer, solutions and source