2023 Putnam

The 84th William Lowell Putnam Mathematical Competition
Saturday, December 2, 2023
A1 For a positive integer n, let fn (x) = unoccupied, then a legal move is to slide the coin from
cos(x) cos(2x) cos(3x) · · · cos(nx). Find the small- (i, j) to (i + 1, j + 1). How many distinct configurations
est n such that | fn′′ (0)| > 2023. of coins can be reached starting from the initial config-
uration by a (possibly empty) sequence of legal moves?
A2 Let n be an even positive integer. Let p be a monic, real B2 For each positive integer n, let k(n) be the number of
polynomial of degree 2n; that is to say, p(x) = x2n + ones in the binary representation of 2023 · n. What is
a2n−1 x2n−1 + · · · + a1 x + a0 for some real coefficients the minimum value of k(n)?
a0 , . . . , a2n−1 . Suppose that p(1/k) = k2 for all integers
k such that 1 ≤ |k| ≤ n. Find all other real numbers x B3 A sequence y1 , y2 , . . . , yk of real numbers is called
for which p(1/x) = x2 . zigzag if k = 1, or if y2 − y1 , y3 − y2 , . . . , yk − yk−1 are
nonzero and alternate in sign. Let X1 , X2 , . . . , Xn be
A3 Determine the smallest positive real number r such
chosen independently from the uniform distribution on
that there exist differentiable functions f : R → R and
[0, 1]. Let a(X1 , X2 , . . . , Xn ) be the largest value of k for
g : R → R satisfying
which there exists an increasing sequence of integers
(a) f (0) > 0, i1 , i2 , . . . , ik such that Xi1 , Xi2 , . . . , Xik is zigzag. Find the
expected value of a(X1 , X2 , . . . , Xn ) for n ≥ 2.
(b) g(0) = 0,
(c) | f ′ (x)| ≤ |g(x)| for all x, B4 For a nonnegative integer n and a strictly increasing se-
(d) |g′ (x)| ≤ | f (x)| for all x, and quence of real numbers t0 ,t1 , . . . ,tn , let f (t) be the cor-
responding real-valued function defined for t ≥ t0 by the
(e) f (r) = 0. following properties:
A4 Let v1 , . . . , v12 be unit vectors in R3 from the origin to
(a) f (t) is continuous for t ≥ t0 , and is twice differen-
the vertices of a regular icosahedron. Show that for ev-
tiable for all t > t0 other than t1 , . . . ,tn ;
ery vector v ∈ R3 and every ε > 0, there exist integers
a1 , . . . , a12 such that ∥a1 v1 + · · · + a12 v12 − v∥ < ε. (b) f (t0 ) = 1/2;
A5 For a nonnegative integer k, let f (k) be the number of (c) limt→t + f ′ (t) = 0 for 0 ≤ k ≤ n;
k
ones in the base 3 representation of k. Find all complex
(d) For 0 ≤ k ≤ n − 1, we have f ′′ (t) = k + 1 when
numbers z such that
tk < t < tk+1 , and f ′′ (t) = n + 1 when t > tn .
31010 −1
∑ (−2) f (k) (z + k)2023 = 0. Considering all choices of n and t0 ,t1 , . . . ,tn such that
k=0 tk ≥ tk−1 + 1 for 1 ≤ k ≤ n, what is the least possible
value of T for which f (t0 + T ) = 2023?
A6 Alice and Bob play a game in which they take turns
choosing integers from 1 to n. Before any integers are B5 Determine which positive integers n have the follow-
chosen, Bob selects a goal of “odd” or “even”. On the ing property: For all integers m that are relatively
first turn, Alice chooses one of the n integers. On the prime to n, there exists a permutation π : {1, 2, . . . , n} →
second turn, Bob chooses one of the remaining inte- {1, 2, . . . , n} such that π(π(k)) ≡ mk (mod n) for all
gers. They continue alternately choosing one of the in- k ∈ {1, 2, . . . , n}.
tegers that has not yet been chosen, until the nth turn,
which is forced and ends the game. Bob wins if the B6 Let n be a positive integer. For i and j in {1, 2, . . . , n},
parity of {k : the number k was chosen on the kth turn} let s(i, j) be the number of pairs (a, b) of nonnegative
matches his goal. For which values of n does Bob have integers satisfying ai + b j = n. Let S be the n-by-n
a winning strategy? matrix whose (i, j) entry is s(i, j). For example, when
6 3 2 2 2
 
B1 Consider an m-by-n grid of unit squares, indexed by 3 0 1 0 1
(i, j) with 1 ≤ i ≤ m and 1 ≤ j ≤ n. There are (m − n = 5, we have S = 2 1 0 0 1. Compute the de-
 
1)(n − 1) coins, which are initially placed in the squares 2 0 0 0 1
(i, j) with 1 ≤ i ≤ m − 1 and 1 ≤ j ≤ n − 1. If a coin oc- 2 1 1 1 2
cupies the square (i, j) with i ≤ m − 1 and j ≤ n − 1 terminant of S.
and the squares (i + 1, j), (i, j + 1), and (i + 1, j + 1) are

2023 Putnam

Uploaded by

Copyright:

Available Formats

2023 Putnam

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

2023 Putnam

Uploaded by

Copyright:

Available Formats

The 84th William Lowell Putnam Mathematical Competition

Saturday, December 2, 2023

You might also like