olymmath

Putnam 1992

William Lowell Putnam Mathematical Competition 1992.

Session A

A1

  • Session A

Prove that f(n)=1−nf(n) = 1-n is the only integer-valued function defined on the integers that satisfies the following conditions.

(i) f(f(n))=nf(f(n)) = n, for all integers nn;

(ii) f(f(n+2)+2)=nf(f(n+2)+2) = n for all integers nn;

(iii) f(0)=1f(0) = 1.

Answer, solutions and source

A2

  • Session A

Define C(α)C(\alpha) to be the coefficient of x1992x^{1992} in the power series about x=0x=0 of (1+x)α(1 + x)^\alpha. Evaluate ∫01(C(−y−1)∑k=119921y+k)dy.\int_0^1 \left( C(-y-1) \sum_{k=1}^{1992} \frac{1}{y+k} \right) dy.

Answer, solutions and source

A3

  • Session A

For a given positive integer mm, find all triples (n,x,y)(n, x, y) of positive integers, with nn relatively prime to mm, which satisfy (x2+y2)m=(xy)n.(x^2 + y^2)^m = (xy)^n.

Answer, solutions and source

A4

  • Session A

Let ff be an infinitely differentiable real-valued function defined on the real numbers. If f(1n)=n2n2+1,n=1,2,3,…,f\left( \frac{1}{n} \right) = \frac{n^2}{n^2 + 1}, n = 1, 2, 3, \dots, compute the values of the derivatives f(k)(0),k=1,2,3,…f^{(k)}(0), k = 1, 2, 3, \dots.

Answer, solutions and source

A5

  • Session A

For each positive integer nn, let an=0a_n = 0 (or 1) if the number of 1's in the binary representation of nn is even (or odd), respectively. Show that there do not exist positive integers kk and mm such that ak+j=ak+m+j=ak+2m+j,a_{k+j} = a_{k+m+j} = a_{k+2m+j}, for 0≤j≤m−10 \leq j \leq m-1.

Answer, solutions and source

A6

  • Session A

Four points are chosen at random on the surface of a sphere. What is the probability that the center of the sphere lies inside the tetrahedron whose vertices are at the four points? (It is understood that each point is independently chosen relative to a uniform distribution on the sphere.)

Answer, solutions and source

Session B

B1

  • Session B

Let SS be a set of nn distinct real numbers. Let ASA_S be the set of numbers that occur as averages of two distinct elements of SS. For a given n≥2n \geq 2, what is the smallest possible number of elements in ASA_S?

Answer, solutions and source

B2

  • Session B

For nonnegative integers nn and kk, define Q(n,k)Q(n, k) to be the coefficient of xkx^k in the expansion of (1+x+x2+x3)n(1 + x + x^2 + x^3)^n. Prove that Q(n,k)=∑j=0k(nj)(nk−2j),Q(n, k) = \sum_{j=0}^k \binom{n}{j} \binom{n}{k-2j}, where (ab)\binom{a}{b} is the standard binomial coefficient. (Reminder: For integers aa and bb with a≥0a \geq 0, (ab)=a!b!(a−b)!\binom{a}{b} = \frac{a!}{b!(a-b)!} for 0≤b≤a0 \leq b \leq a, with (ab)=0\binom{a}{b} = 0 otherwise.)

Answer, solutions and source

B3

  • Session B

For any pair (x,y)(x, y) of real numbers, a sequence (an(x,y))n≥0(a_n(x,y))_{n\geq 0} is defined as follows:

a0(x,y)=x,an+1(x,y)=(an(x,y))2+y22,for n≥0.\begin{aligned}a_0(x, y) &= x, \\ a_{n+1}(x, y) &= \frac{(a_n(x, y))^2 + y^2}{2}, \text{for $n \geq 0$}.\end{aligned}

Find the area of the region {(x,y)∣(an(x,y))n≥0 converges}.\{ (x, y) | (a_n(x, y))_{n \geq 0}\ \text{converges}\}.

Answer, solutions and source

B4

  • Session B

Let p(x)p(x) be a nonzero polynomial of degree less than 1992 having no nonconstant factor in common with x3−xx^3 - x. Let d1992dx1992(p(x)x3−x)=f(x)g(x)\frac{d^{1992}}{dx^{1992}} \left( \frac{p(x)}{x^3 - x} \right) = \frac{f(x)}{g(x)} for polynomials f(x)f(x) and g(x)g(x). Find the smallest possible degree of f(x)f(x).

Answer, solutions and source

B5

  • Session B

Let DnD_n denote the value of the (n−1)×(n−1)(n-1) \times (n-1) determinant [3111⋯11411⋯11151⋯11116⋯1⋮⋮⋮⋮⋱⋮1111⋯n+1].\left[ \begin{array}{cccccc} 3 & 1 & 1 & 1 & \cdots & 1 \\ 1 & 4 & 1 & 1 & \cdots & 1 \\ 1 & 1 & 5 & 1 & \cdots & 1 \\ 1 & 1 & 1 & 6 & \cdots & 1 \\ \vdots & \vdots & \vdots & \vdots & \ddots & \vdots \\ 1 & 1 & 1 & 1 & \cdots & n+1 \end{array} \right]. Is the set {Dnn!}n≥2\left\{ \frac{D_n}{n!} \right\}_{n \geq 2} bounded?

Answer, solutions and source

B6

  • Session B

Let M{\mathcal{M}} be a set of real n×nn \times n matrices such that

(i) I∈MI \in {\mathcal{M}}, where II is the n×nn \times n identity matrix;

(ii) if A∈MA \in {\mathcal{M}} and B∈MB \in {\mathcal{M}}, then either AB∈MAB \in {\mathcal{M}} or −AB∈M-AB \in {\mathcal{M}}, but not both;

(iii) if A∈MA \in {\mathcal{M}} and B∈MB \in {\mathcal{M}}, then either AB=BAAB = BA or AB=−BAAB = -BA;

(iv) if A∈MA \in {\mathcal{M}} and A≠IA \neq I, there is at least one B∈MB \in {\mathcal{M}} such that AB=−BAAB = - BA.

Prove that M{\mathcal{M}} contains at most n2n^2 matrices.

Answer, solutions and source