olymmath

Putnam 2021

William Lowell Putnam Mathematical Competition 2021.

Session A

A1

  • Session A

A grasshopper starts at the origin in the coordinate plane and makes a sequence of hops. Each hop has length 55, and after each hop the grasshopper is at a point whose coordinates are both integers; thus, there are 1212 possible locations for the grasshopper after the first hop. What is the smallest number of hops needed for the grasshopper to reach the point (2021,2021)(2021, 2021)?

Answer, solutions and source

A2

  • Session A

For every positive real number xx, let g(x)=lim⁡r→0((x+1)r+1−xr+1)1r.g(x) = \lim_{r \to 0} ((x+1)^{r+1} - x^{r+1})^{\frac{1}{r}}. Find lim⁡x→∞g(x)x\lim_{x \to \infty} \frac{g(x)}{x}.

Answer, solutions and source

A3

  • Session A

Determine all positive integers NN for which the sphere x2+y2+z2=Nx^2 + y^2 + z^2 = N has an inscribed regular tetrahedron whose vertices have integer coordinates.

Answer, solutions and source

A4

  • Session A

Let I(R)=∬x2+y2≤R2(1+2x21+x4+6x2y2+y4−1+y22+x4+y4)dxdy.I(R) = \iint_{x^2+y^2 \leq R^2} \left( \frac{1+2x^2}{1+x^4+6x^2y^2+y^4} - \frac{1+y^2}{2+x^4+y^4} \right) dx dy. Find lim⁡R→∞I(R),\lim_{R \to \infty} I(R), or show that this limit does not exist.

Answer, solutions and source

A5

  • Session A

Let AA be the set of all integers nn such that 1≤n≤20211 \leq n \leq 2021 and gcd⁡(n,2021)=1\gcd(n, 2021) = 1. For every nonnegative integer jj, let S(j)=∑n∈Anj.S(j) = \sum_{n \in A} n^j. Determine all values of jj such that S(j)S(j) is a multiple of 2021.

Answer, solutions and source

A6

  • Session A

Let P(x)P(x) be a polynomial whose coefficients are all either 00 or 11. Suppose that P(x)P(x) can be written as a product of two nonconstant polynomials with integer coefficients. Does it follow that P(2)P(2) is a composite integer?

Answer, solutions and source

Session B

B1

  • Session B

Suppose that the plane is tiled with an infinite checkerboard of unit squares. If another unit square is dropped on the plane at random with position and orientation independent of the checkerboard tiling, what is the probability that it does not cover any of the corners of the squares of the checkerboard?

Answer, solutions and source

B2

  • Session B

Determine the maximum value of the sum S=∑n=1∞n2n(a1a2⋯an)1/nS = \sum_{n=1}^\infty \frac{n}{2^n} (a_1 a_2 \cdots a_n)^{1/n} over all sequences a1,a2,a3,⋯a_1, a_2, a_3, \cdots of nonnegative real numbers satisfying ∑k=1∞ak=1.\sum_{k=1}^\infty a_k = 1.

Answer, solutions and source

B3

  • Session B

Let h(x,y)h(x,y) be a real-valued function that is twice continuously differentiable throughout R2\mathbb{R}^2, and define ρ(x,y)=yhx−xhy.\rho(x,y) = yh_x - xh_y. Prove or disprove: For any positive constants dd and rr with d>rd>r, there is a circle S\mathcal{S} of radius rr whose center is a distance dd away from the origin such that the integral of ρ\rho over the interior of S\mathcal{S} is zero.

Answer, solutions and source

B4

  • Session B

Let F0,F1,…F_0, F_1, \dots be the sequence of Fibonacci numbers, with F0=0F_0 = 0, F1=1F_1 = 1, and Fn=Fn−1+Fn−2F_n = F_{n-1} + F_{n-2} for n≥2n \geq 2. For m>2m > 2, let RmR_m be the remainder when the product ∏k=1Fm−1kk\prod_{k=1}^{F_m-1} k^k is divided by FmF_m. Prove that RmR_m is also a Fibonacci number.

Answer, solutions and source

B5

  • Session B

Say that an nn-by-nn matrix A=(aij)1≤i,j≤nA = (a_{ij})_{1 \leq i,j \leq n} with integer entries is very odd if, for every nonempty subset SS of {1,2,…,n}\{1,2,\dots,n\}, the ∣S∣|S|-by-∣S∣|S| submatrix (aij)i,j∈S(a_{ij})_{i,j \in S} has odd determinant. Prove that if AA is very odd, then AkA^k is very odd for every k≥1k \geq 1.

Answer, solutions and source

B6

  • Session B

Given an ordered list of 3N3N real numbers, we can trim it to form a list of NN numbers as follows: We divide the list into NN groups of 33 consecutive numbers, and within each group, discard the highest and lowest numbers, keeping only the median.

Consider generating a random number XX by the following procedure: Start with a list of 320213^{2021} numbers, drawn independently and uniformly at random between 0 and 1. Then trim this list as defined above, leaving a list of 320203^{2020} numbers. Then trim again repeatedly until just one number remains; let XX be this number. Let μ\mu be the expected value of ∣X−12∣|X - \frac{1}{2}|. Show that μ≥14(23)2021.\mu \geq \frac{1}{4} \left( \frac{2}{3} \right)^{2021}.

Answer, solutions and source