The 62nd William Lowell Putnam Mathematical Competition Saturday, December 1, 2001

The 62nd William Lowell Putnam Mathematical Competition
Saturday, December 1, 2001
A-1 Consider a set and a binary operation , i.e., for each B-2 Find all pairs of real numbers 6/ QE
satisfying the sys-
, . Assume
for all tem of equations
. Prove that
for all .
" "
A-2 You have coins . For each , ! is bi- ( 6 / (SR Q
&RE/ ( Q
ased so that, when tossed, it has probability "#$ &%'()"
/ % Q
" "
of fallings heads. If the * coins are tossed, what is the 2 Q %$ Q 1 2T/ 1
U
probability that the number of heads is odd? Express / %
the answers as a rational function of * .
A-3 For each integer + , consider the polynomial B-3 For any positive integer * , let VW*YX denote the closest in-
,.- teger to Z * . Evaluate
&/
0 /$12) &%'+3(54
/ ( 6+725%

,8- [
For what values of + is &/
the product of two non- \ %E_ ` (M%aY_ ^`
constant polynomials with integer coefficients?
^]8 %
A-4 Triangle 9:; has an area 1. Points < => lie, respec-
tively, on sides :; , ?9 , 9?: such that 9?< bisects : =
at point @ , : = bisects > at point , and > bisects
B-4 Let
b denote the set of rational
hgi numbers
P different from
9< at point A . Find the area of the triangle @ A . 2;" D "dc . Define e7f by e. 6/ /j23"#'/ .
Prove or disprove that
A-5 Prove that there are unique positive integers , * such [
that
B8 2) (C"
%ED'DF" . k
eml ^n
o)p$
A-6 Can an arc of a parabola inside a circle of radius 1 have ]8
a length greater than 4?
B-1 Let * be an even positive integer. Write the numbers where e l n denotes e composed with itself * times.
" % G * in the squares of an *IHJ* grid so that the
-th row, from left to right, is B-5 Let and be real numbers in the interval 6D "#E%
,
and let q be a continuous real-valued function such
6K2L"
&*
()" 6;2M"
*N(M% O 6;2M"
*P(5* that qY rqs 6/
O
tu qs 6/
( / for all real / . Prove that
Color the squares of the grid so that half of the squares qs 6/
Cv / for some constant v .
in each row and in each column are red and the other
half are black (a checkerboard coloring is one possi- B-6 Assume that
$w. is an increasing sequence of pos-
bility). Prove that for each coloring, the sum of the itive real numbers such that xryrz F#'* D . Must
numbers on the red squares is equal to the sum of the there exist infinitely many positive integers * such that
numbers on the black squares. ( ^B % for } " % G *K2)" ?
a{ {|
This is trial version

www.adultpdf.com
The 63rd William Lowell Putnam Mathematical Competition
A1 Let k be a fixed positive integer. The n-th derivative of Each player, in turn, signs his or her
1
xk −1
has the form (xkP−1)
n (x)
n+1 where Pn (x) is a polyno-
name on a previously unsigned face. The
mial. Find Pn (1). winner is the player who first succeeds in
signing three faces that share a common
A2 Given any five points on a sphere, show that some four vertex.
of them must lie on a closed hemisphere.
A3 Let n ≥ 2 be an integer and Tn be the number of non- Show that the player who signs first will always win by
empty subsets S of {1, 2, 3, . . . , n} with the property playing as well as possible.
that the average of the elements of S is an integer. Prove
that Tn − n is always even. B3 Show that, for all integers n > 1,
A4 In Determinant Tic-Tac-Toe, Player 1 enters a 1 in an n
1 1 1 1
empty 3 × 3 matrix. Player 0 counters with a 0 in a va- < − 1− < .
cant position, and play continues in turn until the 3 × 3 2ne e n ne
matrix is completed with five 1’s and four 0’s. Player
0 wins if the determinant is 0 and player 1 wins other- B4 An integer n, unknown to you, has been randomly
wise. Assuming both players pursue optimal strategies, chosen in the interval [1, 2002] with uniform probabil-
who will win and how? ity. Your objective is to select n in an odd number of
A5 Define a sequence by a0 = 1, together with the rules guesses. After each incorrect guess, you are informed
a2n+1 = an and a2n+2 = an + an+1 for each inte- whether n is higher or lower, and you must guess an
ger n ≥ 0. Prove that every positive rational number integer on your next turn among the numbers that are
appears in the set still feasibly correct. Show that you have a strategy so
that the chance of winning is greater than 2/3.
an−1 1 1 2 1 3
:n≥1 = , , , , ,... .
an 1 2 1 3 2 B5 A palindrome in base b is a positive integer whose base-
b digits read the same backwards and forwards; for ex-
A6 Fix an integer b ≥ 2. Let f (1) = 1, f (2) = 2, and ample, 2002 is a 4-digit palindrome in base 10. Note
for each n ≥ 3, define f (n) = nf (d), where d is the that 200 is not a palindrome in base 10, but it is the 3-
number of base-b digits of n. For which values of b does digit palindrome 242 in base 9, and 404 in base 7. Prove
∞ that there is an integer which is a 3-digit palindrome in
X 1
base b for at least 2002 different values of b.
n=1
f (n)
converge? B6 Let p be a prime number. Prove that the determinant of

the matrix
B1 Shanille O’Keal shoots free throws on a basketball
court. She hits the first and misses the second, and 
x y z

thereafter the probability that she hits the next shot is  xp y p z p 
equal to the proportion of shots she has hit so far. What 2 2 2
xp y p z p
is the probability she hits exactly 50 of her first 100
shots?
is congruent modulo p to a product of polynomials of
B2 Consider a polyhedron with at least five faces such that the form ax + by + cz, where a, b, c are integers. (We
exactly three edges emerge from each of its vertices. say two integer polynomials are congruent modulo p if
Two players play the following game: corresponding coefficients are congruent modulo p.)

www.adultpdf.com
The 64th William Lowell Putnam Mathematical Competition
A1 Let be a fixed positive integer. How many ways are

B1 Do there exist polynomials 'a6 ( % 'b6 ( "A 'bc ( "d 'ac ( such

there to write as a sum of positive integers,
, with an arbitrary positive integer
that
e f6 c 6 c M 'a6 ( A 'bc ( % 'b6 ( d 'bc (

and ? For example, with
A2 Let
!!!"$# and % % &!!! % # be nonnegative
there are four ways: 4, 2+2, 1+1+2, 1+1+1+1.
holds identically?
' " #( *)"# ' % % % #( *)"#

real numbers. Show that
g g be!!a!positive
# " #
, jkform O sequence
entries

B2 Let integer. Starting with the
,+ ' % -( ' % ( ' # % #(/. )"# ! h 72i !!! "#
l5#
jm2n by taking the averages of two con-
a new sequence of
Optheo entries,
secutive entries in the first sequence. Repeat the aver-
and continue until 6 the

aging of neighbors on second sequence to obtain a
02135476 98: 16 ;"< 4=6 98:&; 6 1> 8 6 8 1 8 6?0
A3 Find the minimum value of
third sequence of
6 $
o r a single number # .
6 Show that #]q
final sequence produced consists of
.
A4 Suppose that @ % AB"CD"EF"G are real numbers, IK H J

for real numbers .
L
C M
H J #
B3 Show that for each positive integer n,
and
that
0 , 6such % 6 6 9A 0 0 C 6 9E 6 NG 0 ts$ vxw y 8z|{$ o !!!}
~ rP !
u
0 % =O P
A 0 0 E 7O PCQG 0 ! (Here 8-z denotes the least common ~ 6
y
denotes the greatest integer
6 .)
for all real numbers . Show that
multiple, and
' O '
is a lattice path of upsteps ( and B4 Let
downsteps 6 ( that starts at the origin R and never
'a ( M h O % g O A 9d O O
A5 A Dyck -path
dips below the -axis. A return is a maximal sequence

of contiguous downsteps that terminates on the -axis.
6 M 'W T ( 'a T ( 'W T g ( 'a T h (
where @ % "ABd are integers, K
T Q T is a rational number and T H \ J .T pShow
For example, the Dyck 5-path illustrated has two re-
turns, of length 3 and 1 respectively.
H T g that T hif,
then T T is a rational number.
B5 Let CDE , and G be equidistant points on the circumfer-

ence of a circle of unit radius centered at R , and let
be any point in the circle’s interior. Let @ % "A be the dis-
tance from to CE"G , respectively. Show that there
O
is a triangle with side lengths @ % A , and that the area of
' O ( depends only on the distance from to R .
Show that there is a one-to-one correspondence be-
tween the Dyck -paths with no return of even length
'a6 ( be a continuous real-valued function defined
this triangle
BT U ' ( V Y X S
and the Dyck -paths.
S W
' V B
V ( on the interval + J . . Show that
B6 Let
V ZX S V [ H V V \ V ]^ 0 'b6 ( 'ac ( 0 d 6 d c 0 'b6 ( 0 d 6 !

A6 For a set of nonnegative integers, let denote
the number of ordered pairs such that ,
E
, , and
'T_ ( T` ' (
. Is it possible to
partition the nonnegative integers into two sets and C
in such a way that for all ?

www.adultpdf.com
A1 Basketball star Shanille O’Keal’s team statistician B1 Let P (x) = cn xn + cn−1 xn−1 + · · · + c0 be a poly-
keeps track of the number, S(N ), of successful free nomial with integer coefficients. Suppose that r is a
throws she has made in her first N attempts of the sea- rational number such that P (r) = 0. Show that the n
son. Early in the season, S(N ) was less than 80% of numbers
N , but by the end of the season, S(N ) was more than
80% of N . Was there necessarily a moment in between cn r, cn r2 + cn−1 r, cn r3 + cn−1 r2 + cn−2 r,
when S(N ) was exactly 80% of N ? . . . , cn rn + cn−1 rn−1 + · · · + c1 r
A2 For i = 1, 2 let Ti be a triangle with side lengths
ai , bi , ci , and area Ai . Suppose that a1 ≤ a2 , b1 ≤ are integers.
b2 , c1 ≤ c2 , and that T2 is an acute triangle. Does it
follow that A1 ≤ A2 ? B2 Let m and n be positive integers. Show that
A3 Define a sequence {un }∞ n=0 by u0 = u1 = u2 = 1, and

(m + n)! m! n!
< m n.
thereafter by the condition that (m + n)m+n m n

un un+1
det = n! B3 Determine all real numbers a > 0 for which there ex-
un+2 un+3
ists a nonnegative continuous function f (x) defined on
for all n ≥ 0. Show that un is an integer for all n. (By [0, a] with the property that the region
convention, 0! = 1.)
R = {(x, y); 0 ≤ x ≤ a, 0 ≤ y ≤ f (x)}
A4 Show that for any positive integer n, there is an integer
N such that the product x1 x2 · · · xn can be expressed has perimeter k units and area k square units for some
identically in the form real number k.
N
X B4 Let n be a positive integer, n ≥ 2, and put θ = 2π/n.
x1 x2 · · · xn = ci (ai1 x1 + ai2 x2 + · · · + ain xn )n Define points Pk = (k, 0) in the xy-plane, for k =
i=1 1, 2, . . . , n. Let Rk be the map that rotates the plane
counterclockwise by the angle θ about the point Pk . Let
where the ci are rational numbers and each aij is one of
R denote the map obtained by applying, in order, R1 ,
the numbers −1, 0, 1.
then R2 , . . . , then Rn . For an arbitrary point (x, y),
A5 An m × n checkerboard is colored randomly: each find, and simplify, the coordinates of R(x, y).
square is independently assigned red or black with
probability 1/2. We say that two squares, p and q, are in B5 Evaluate
the same connected monochromatic component if there ∞ x n
is a sequence of squares, all of the same color, starting Y 1 + xn+1

lim .
at p and ending at q, in which successive squares in the x→1−
n=0
1 + xn
sequence share a common side. Show that the expected
number of connected monochromatic regions is greater
than mn/8. B6 Let A be a non-empty set of positive integers, and let
N (x) denote the number of elements of A not exceed-
A6 Suppose that f (x, y) is a continuous real-valued func- ing x. Let B denote the set of positive integers b that
tion on the unit square 0 ≤ x ≤ 1, 0 ≤ y ≤ 1. Show can be written in the form b = a − a0 with a ∈ A and
that a0 ∈ A. Let b1 < b2 < · · · be the members of B, listed
Z 1 Z 1 2 Z 1 Z 1 2 in increasing order. Show that if the sequence bi+1 − bi
is unbounded, then
f (x, y)dx dy + f (x, y)dy dx
0 0 0 0
Z 1 Z 1 2 Z 1 Z 1 lim N (x)/x = 0.
2 x→∞
≤ f (x, y)dx dy + (f (x, y)) dx dy.
0 0 0 0

www.adultpdf.com
A1 Show that every positive integer is a sum of one or more B2 Find all positive integers n, k1 , . . . , kn such that k1 +
numbers of the form 2r 3s , where r and s are nonneg- · · · + kn = 5n − 4 and
ative integers and no summand divides another. (For
example, 23 = 9 + 8 + 6.) 1 1
+ ··· + = 1.
k1 kn
A2 Let S = {(a, b)|a = 1, 2, . . . , n, b = 1, 2, 3}. A rook
tour of S is a polygonal path made up of line segments
connecting points p1 , p2 , . . . , p3n in sequence such that B3 Find all differentiable functions f : (0, ∞) → (0, ∞)
for which there is a positive real number a such that
(i) pi ∈ S,
a x
(ii) pi and pi+1 are a unit distance apart, for 1 ≤ i < f0 =
3n, x f (x)
(iii) for each p ∈ S there is a unique i such that pi = p.
for all x > 0.
How many rook tours are there that begin at (1, 1)
B4 For positive integers m and n, let f (m, n) denote the
and end at (n, 1)?
number of n-tuples (x1 , x2 , . . . , xn ) of integers such
(An example of such a rook tour for n = 5 was depicted that |x1 | + |x2 | + · · · + |xn | ≤ m. Show that f (m, n) =
in the original.) f (n, m).
A3 Let p(z) be a polynomial of degree n, all of whose ze- B5 Let P (x1 , . . . , xn ) denote a polynomial with real coef-
ros have absolute value 1 in the complex plane. Put ficients in the variables x1 , . . . , xn , and suppose that
g(z) = p(z)/z n/2 . Show that all zeros of g 0 (z) = 0
have absolute value 1.
∂2 ∂2

+ · · · + P (x1 , . . . , xn ) = 0 (identically)
A4 Let H be an n × n matrix all of whose entries are ±1 ∂x21 ∂x2n
and whose rows are mutually orthogonal. Suppose H
has an a × b submatrix whose entries are all 1. Show and that
that ab ≤ n.
x21 + · · · + x2n divides P (x1 , . . . , xn ).
A5 Evaluate
Z 1
ln(x + 1) Show that P = 0 identically.
dx.
0 x2 + 1
B6 Let Sn denote the set of all permutations of the numbers
1, 2, . . . , n. For π ∈ Sn , let σ(π) = 1 if π is an even
A6 Let n be given, n ≥ 4, and suppose that P1 , P2 , . . . , Pn
permutation and σ(π) = −1 if π is an odd permutation.
are n randomly, independently and uniformly, chosen
Also, let ν(π) denote the number of fixed points of π.
points on a circle. Consider the convex n-gon whose
Show that
vertices are Pi . What is the probability that at least one
of the vertex angles of this polygon is acute? X σ(π) n
= (−1)n+1 .
B1 Find a nonzero polynomial P (x, y) such that ν(π) + 1 n+1
π∈Sn
P (bac, b2ac) = 0 for all real numbers a. (Note:
bνc is the greatest integer less than or equal to ν.)

www.adultpdf.com
A1 Find the volume of the region of points (x, y, z) such B1 Show that the curve x3 + 3xy + y 3 = 1 contains only
that one set of three distinct points, A, B, and C, which are
vertices of an equilateral triangle, and find its area.
(x2 + y 2 + z 2 + 8)2 ≤ 36(x2 + y 2 ).
B2 Prove that, for every set X = {x1 , x2 , . . . , xn } of n
A2 Alice and Bob play a game in which they take turns real numbers, there exists a non-empty subset S of X
removing stones from a heap that initially has n stones. and an integer m such that
The number of stones removed at each turn must be one
less than a prime number. The winner is the player who
X 1
m + s ≤ .

takes the last stone. Alice plays first. Prove that there n+1
s∈S
are infinitely many n such that Bob has a winning strat-
egy. (For example, if n = 17, then Alice might take B3 Let S be a finite set of points in the plane. A linear
6 leaving 11; then Bob might take 1 leaving 10; then partition of S is an unordered pair {A, B} of subsets of
Alice can take the remaining stones to win.) S such that A ∪ B = S, A ∩ B = ∅, and A and B
lie on opposite sides of some straight line disjoint from
A3 Let 1, 2, 3, . . . , 2005, 2006, 2007, 2009, 2012, 2016, . . . S (A or B may be empty). Let LS be the number of
be a sequence defined by xk = k for k = 1, 2, . . . , 2006 linear partitions of S. For each positive integer n, find
and xk+1 = xk + xk−2005 for k ≥ 2006. Show that the the maximum of LS over all sets S of n points.
sequence has 2005 consecutive terms each divisible by
2006. B4 Let Z denote the set of points in Rn whose coordinates
are 0 or 1. (Thus Z has 2n elements, which are the
A4 Let S = {1, 2, . . . , n} for some integer n > 1. Say a vertices of a unit hypercube in Rn .) Given a vector sub-
permutation π of S has a local maximum at k ∈ S if space V of Rn , let Z(V ) denote the number of members
of Z that lie in V . Let k be given, 0 ≤ k ≤ n. Find
(i) π(k) > π(k + 1) for k = 1; the maximum, over all vector subspaces V ⊆ Rn of
(ii) π(k − 1) < π(k) and π(k) > π(k + 1) for 1 < dimension k, of the number of points in V ∩ Z.) [Ed-
k < n; itorial note: the proposers probably intended to write
(iii) π(k − 1) < π(k) for k = n. Z(V ) for “the number of points in V ∩ Z”, but this
changes nothing.]
(For example, if n = 5 and π takes values at 1, 2, 3, 4, 5
of 2, 1, 4, 5, 3, then π has a local maximum of 2 at k = B5 For each continuous function f : [0, 1] → R, let I(f ) =
R1 2 R1 2
1, and a local maximum of 5 at k = 4.) What is the 0
x f (x) dx and J(x) = 0 x (f (x)) dx. Find the
average number of local maxima of a permutation of S, maximum value of I(f ) − J(f ) over all such functions
averaging over all permutations of S? f.
A5 Let n be a positive odd integer and let θ be a real number B6 Let k be an integer greater than 1. Suppose a0 > 0, and
such that θ/π is irrational. Set ak = tan(θ + kπ/n), define
k = 1, 2, . . . , n. Prove that
1
a1 + a2 + · · · + an an+1 = an + √
k a
n
a1 a2 · · · an
for n > 0. Evaluate
is an integer, and determine its value.
ak+1
n
A6 Four points are chosen uniformly and independently at lim .
n→∞ nk
random in the interior of a given circle. Find the proba-
bility that they are the vertices of a convex quadrilateral.

www.adultpdf.com
A1 Find all values of α for which the curves y = αx2 + f (f (n) + 1) if and only if n = 1. [Editor’s note: one
1 1
αx + 24 and x = αy 2 + αy + 24 are tangent to each must assume f is nonconstant.]
other.
B2 Suppose that f : [0, 1] → R has a continuous derivative
A2 Find the least possible area of a convex set in the plane R1
and that 0 f (x) dx = 0. Prove that for every α ∈
that intersects both branches of the hyperbola xy = 1 (0, 1),
and both branches of the hyperbola xy = −1. (A set S
Z α
in the plane is called convex if for any two points in S

1
max |f ′ (x)|.

the line segment connecting them is contained in S.)
f (x) dx ≤

0 8 0≤x≤1
A3 Let k be a positive integer. Suppose that the integers √
1, 2, 3, . . . , 3k + 1 are written down in random order. B3 Let x0 = 1 and for n ≥ 0, let xn+1 = 3xn + ⌊xn 5⌋.
What is the probability that at no time during this pro- In particular, x1 = 5, x2 = 26, x3 = 136, x4 = 712.
cess, the sum of the integers that have been written up Find a closed-form expression for x2007 . (⌊a⌋ means
to that time is a positive integer divisible by 3? Your the largest integer ≤ a.)
answer should be in closed form, but may include fac- B4 Let n be a positive integer. Find the number of pairs
torials. P, Q of polynomials with real coefficients such that
A4 A repunit is a positive integer whose digits in base 10 (P (X))2 + (Q(X))2 = X 2n + 1
are all ones. Find all polynomials f with real coeffi-
cients such that if n is a repunit, then so is f (n). and deg P > deg Q.
A5 Suppose that a finite group has exactly n elements of B5 Let k be a positive integer. Prove that there exist poly-
order p, where p is a prime. Prove that either n = 0 or nomials P0 (n), P1 (n), . . . , Pk−1 (n) (which may de-
p divides n + 1. pend on k) such that for any integer n,
A6 A triangulation T of a polygon P is a finite collection j n kk jnk j n kk−1
of triangles whose union is P , and such that the inter- = P0 (n) + P1 (n) + · · · + Pk−1 (n) .
section of any two triangles is either empty, or a shared k k k
vertex, or a shared side. Moreover, each side is a side (⌊a⌋ means the largest integer ≤ a.)
of exactly one triangle in T . Say that T is admissible
if every internal vertex is shared by 6 or more triangles. B6 For each positive integer n, let f (n) be the number of
For example, [figure omitted.] Prove that there is an ways to make n! cents using an unordered collection of
integer Mn , depending only on n, such that any admis- coins, each worth k! cents for some k, 1 ≤ k ≤ n.
sible triangulation of a polygon P with n sides has at Prove that for some constant C, independent of n,
most Mn triangles.
2
/2−Cn −n2 /4 2
/2+Cn −n2 /4
nn e ≤ f (n) ≤ nn e .
B1 Let f be a polynomial with positive integer coefficients.
Prove that if n is a positive integer, then f (n) divides

www.adultpdf.com
A1 Let f : R2 → R be a function such that f (x, y) + (The elements of G in the sequence are not required to
f (y, z) + f (z, x) = 0 for all real numbers x, y, and z. be distinct. A subsequence of a sequence is obtained
Prove that there exists a function g : R → R such that by selecting some of the terms, not necessarily consec-
f (x, y) = g(x) − g(y) for all real numbers x and y. utive, without reordering them; for example, 4, 4, 2 is a
subsequence of 2, 4, 6, 4, 2, but 2, 2, 4 is not.)
A2 Alan and Barbara play a game in which they take turns
filling entries of an initially empty 2008 × 2008 array. B1 What is the maximum number of rational points that can
Alan plays first. At each turn, a player chooses a real lie on a circle in R2 whose center is not a rational point?
number and places it in a vacant entry. The game ends (A rational point is a point both of whose coordinates
when all the entries are filled. Alan wins if the determi- are rational numbers.)
nant of the resulting matrix is nonzero; Barbara wins if
it is zero. Which player has a winning strategy? B2 RLet F0 (x) = ln x. For n ≥ 0 and x > 0, let Fn+1 (x) =
x
0
Fn (t) dt. Evaluate
A3 Start with a finite sequence a1 , a2 , . . . , an of positive
integers. If possible, choose two indices j < k such
n!Fn (1)
that aj does not divide ak , and replace aj and ak by lim .
gcd(aj , ak ) and lcm(aj , ak ), respectively. Prove that if n→∞ ln n
this process is repeated, it must eventually stop and the B3 What is the largest possible radius of a circle contained
final sequence does not depend on the choices made. in a 4-dimensional hypercube of side length 1?
(Note: gcd means greatest common divisor and lcm
means least common multiple.) B4 Let p be a prime number. Let h(x) be a
polynomial with integer coefficients such that
A4 Define f : R → R by h(0), h(1), . . . , h(p2 − 1) are distinct modulo p2 .
( Show that h(0), h(1), . . . , h(p3 − 1) are distinct
x if x ≤ e modulo p3 .
f (x) =
xf (ln x) if x > e.
B5 Find all continuously differentiable functions f : R →
P∞ 1 R such that for every rational number q, the number
Does converge?
n=1 f (n) f (q) is rational and has the same denominator as q.
(The denominator of a rational number q is the unique
A5 Let n ≥ 3 be an integer. Let f (x) and g(x) be
positive integer b such that q = a/b for some integer a
polynomials with real coefficients such that the points
with gcd(a, b) = 1.) (Note: gcd means greatest com-
(f (1), g(1)), (f (2), g(2)), . . . , (f (n), g(n)) in R2 are
mon divisor.)
the vertices of a regular n-gon in counterclockwise or-
der. Prove that at least one of f (x) and g(x) has degree
B6 Let n and k be positive integers. Say that a permutation
greater than or equal to n − 1.
σ of {1, 2, . . . , n} is k-limited if |σ(i) − i| ≤ k for all
A6 Prove that there exists a constant c > 0 such that in ev- i. Prove that the number of k-limited permutations of
ery nontrivial finite group G there exists a sequence of {1, 2, . . . , n} is odd if and only if n ≡ 0 or 1 (mod
length at most c ln |G| with the property that each el- 2k + 1).
ement of G equals the product of some subsequence.

www.adultpdf.com
Solutions to the 62nd William Lowell Putnam Mathematical Competition
Manjul Bhargava, Kiran Kedlaya, and Lenny Ng

A–1 The hypothesis

implies
Note: a more sophisticated interpretation of this argu-
for all

(by replacing
!" by ),#and hence
$% ment can be given using Galois theory. Namely, if a
for all (using ). is neither a square nor
lm a lm
twice

a square, then the number
*),+.- fields d and d 3 are distinct quadratic fields,
A–2 Let &#' denote) the desired probability. Then &( ,
so their compositum is a number fieldf of degree 4,
and, for /0 ,
) whose Galois group acts transitively on b d a=b d 3 i .
21 3 / 1 )<; Thus & \ is irreducible.
& ' ) 6 & '879( 4 ):6 & '879(
3 /54 3 / 4 oCTp t
u eo uv
;=) ) A–4 Choose n so that qUr nMsUr r s
21 3 / p
) 6 & '879( 4 )?> rUs , and let w x yz${ denote the area of triangle
3 /54 3 5/ 4 u u|t
x^yz . Then w sq{ w q{ since the tri-
+CB E-.+.F
The recurrence yields &A@ 3 , &#D , and by a angles
u
have
}
the
+
same
u
altitude 2);
and base. t Also
simple induction, one then checks that for general / one w sUq|{ sq sUr w sUr|{ n , and w~qUr {
+: ), + t<+ u| u );o[
has & ' / 3 /54 . qr sUr r r w sUr{ n (e.g., by the
law of sines). Adding this all up yields
Note: Richard Stanley points out the following
HJI 'KML H +:
nonin-
),
ductive argument. Put G HPO HP ( 4 3.N 3.N 4 ; )< u u t t
w sUq{:4=w s {k4=w~qUr {
then the coefficient of in G is the probability of R)$; R)$;o, ; ; o
getting exactly Q heads. Thus the desired number is 3 n 4n 3 n n
R),S; T;U),R+
G G 3 , and both values of G can be com- R) o,V) oCR) pp,R) )
),V)
puted directly: G , and or n 4 . Similarly 4 4n .
) - ;) ) _ Z
8 _:
T;U),$ 3 / Let H G ` )[w +:) HP w be theRfunction
m given by
G -XW BXWZY,Y[YCW ) ) > G 4 ; then G G G n n . However,
3 /54 3 /54 H H HP
HP^`_ H @
G is strictlyHdecreasing R
in , so G G is increas-
A–3 By the quadratic formula, if &]\ , then ing and H
G G G isHdecreasing.
R H
Thus there is at most
acb 3Cd 3 a one such that G G G ; in fact, since the equa-
egf b
4 3 , and hence the four roots of & \ are C ;) B.+
ahb d 3 i
given by d . If &#\ factors into two tion G has
op
a positive root 4 d 3 , we
nonconstant
polynomials over the integers, then some must have n .
subset of consisting of one or two elements form the u t u|t<+u u
We u
now compute+ w tU s
u
{
t
r
.+
w sUr{ ,
roots of a polynomial with integer coefficients. 3 , analogously
w sU!{ sU s w s {
u .+ 9 u ;
First suppose this subset has a single element, say w~sUr { w~r { 3 , and w~ { w sUr{
ajb d 3 u ; ; u [*);-.C+ ,E 7 D
d ; this element
must be a rational number. w sU!{ w~sUr { w~r { 3 .
Then d ahb d 3 @ 3 4 aEb 3Cd 3 a

is an integer, ) o[^)
@
so a is twice a perfect square, say a 3 / . But then Note: the key relation n 4 can also be de-
ab d 3 V b ), d 3 b )
rived by computing using homogeneous coordinates or
d
/ is only rational if / , i.e.,
if a 3 . vectors.
Next, suppose that the subset contains two elements; '#(;2 )[ ' _._8)
f f A–5 Suppose 4 3
. Notice that
then we can take it to be one of d a*b d 3ki , d 3 b
'#( [
) '
; )
a i f 4=w 4 { is a multiple of ; thus divides
d or b d a 4 d 3 i . In all cases, the sum and the 3
_C_
3

3 W
F
W
)C)
W
) -
[
.
product of the elements of the subset must be a ratio- Vl _C_:) h)
nal number. In the first case, this means 3 d a , Since
-.
3 is divisible by 3, we must
'#( have
) '
,
a , otherwise one of and 4 is a mul-
so is
l
a perfect square. In the second case, we have
, contradiction. In the third case, tiple of 3 and the other is not, so their difference cannot
%l we have
3 d 3 ' #( )X -.
a @ el
d 4 d 3 , or a 4 3 4 3Cd 3 a , which be divisible

by 3. Now
)[ ' V)X ^-.
, so we must
means that a is twice a perfect square. have 4 , which forces / to be even,
H and in particular at least 2.
We conclude that & \ factors into two nonconstant '#( ;U ), ' ¡;U ), ' ¢
polynomials over the integers if and only if a is either If is even, then ;U
4 4
), ' £;U)X ¢
.
a square or twice a square. Since / is even, 4 . Since

www.adultpdf.com
_._8)UE)¤ ¢ + +
3 ,),this is impossible.
_C_:)m2F ).)
Thus is odd,
)[-
every row contains exactly / 3 elements of and / 3
and so must
' #( ;¥
divide
), ' ¢
W W . Moreover,
UV)¤ ¢
elements of s , Ä Ä
4 , so .
F )C) ),- o[ o[
Of the divisors of W W , those congruent to 1 mod G G >
3 are precisely those not divisible by 11 (since 7F and )[13 ÅÇÆÉÈ ÅÆMÊ
-
are both congruent
to 1 mod 3). Thus divides
)X ¢
W
),- . +
Now is only possible if divides . Similarly, because every
+ column contains exactly / 3
¤j) ); ' ¦ _._8)
We cannot have , since for any 3 3 elements of andÄ / 3 elements
Ä of s ,
*§)[-
/ . Thus the only possibility is . One eas-
=£),-8 o[ o[
ily checks that / 3 is a solution; all that Â Â >
remains is to check )[- '#that no _Cother works.
/ )Z ©.In
fact,
ÅÇÆMÈ ÅÆMÊ
( _:)
if /¨0 3 , then
),- ' #( )[- ©C
3 . But
5e)[-:
since / is even, contradiction. It follows
Ä that Ä
Thus / 3 is the unique solution.
o[ o, ) o[ o[ ).
Note:
_._
once one has
ª
that
);
/ is
), '
even, one can use that) G /4ËÂ 4 G /4XÂ 4
'#( ÅÆMÈ ÅÆMÊ
3 3 4 4 is divisible by 4
to rule out cases.
as desired.
A–6 The answer is yes. Consider the arc of the parabola
« ¬u|H @ H @ « ;%), @ j)
inside the circleu
4
)[+
, where Note: Richard Stanley points out a theorem of Ryser
we initially assume that _:_.
0 3 . This intersects the
u;=)[+u, u; (see Ryser, Combinatorial Mathematics,
u
Theorem_3.1)
;=)
b
circle
),R+u|
in three points, andu
d 3 3 that can also be applied. Namely, if and s are
. We claim that for sufficiently _large,
:_.
the matrices with the same row and column sums, then
length ® of the parabolic
u;),+u5[ u¤;X),R+u| arc between and there is a sequence of operations on 3 W 3 matrices of
d 3 3 is greater than 3 , which im- the form
plies the desired result by symmetry. We express ® us- _h) ) _
ing the usual formula for arclength: 1
)%_ 6
1
_¬) 6
@° 7#(²± °
¯ ) u|H @?µ H
® 4 3 u
³ ´ or vice versa, which transforms into s . If we iden-
) @ @° 7#( tify 0 and 1 with red and black, then the given color-
¯ ) H @ µ H
u
³ ´ 4 ing and the checkerboard coloring both satisfy the sum
3
condition. Since the desired result is clearly true for the
) @ @° 79(
¯ ) H @ ;HP µ H; checkerboard coloring, and performing the matrix op-
3 4 u·¶ 4 3¹¸
3 ³ ´ erations does not affect this, the desired result follows
in general.
;!H
where we have artificially introduced
Hº=_
into the inte-
grand in the last step. Now, for , B–2 By adding and subtracting the two given equations, we
) ) ) obtain the equivalent pair of equations
) H @ ;!H º
4 ) H @ H 0 ) H @ H ), » +.H%H )[_.H @ « @ B «
´ d 3 d 3 4
4 4 4 3 4 4
),+ « %BCH ),_CH @ « @
µ H+: 3 H ),
4 4
« >
since ¼¾³ ½ 4 diverges, so does
) H @ ;H µ H
¼]³ ½ d 4 . Hence, for sufficiently large H
u @ @° 7#( ) H @ ; H µ H Multiplying the former by and the latter by « , then
, we have ¼ ³ d 4 0 3 , and hence adding and subtracting the two resulting equations, we
®0 3 .
obtain another pair of equations equivalent to the given
Note:u a numerical
-M¢ F
computation shows that one must ones,
take 0 > to obtain ®0 3 , and that the maximum
¢ _C_ F u%¿%À¹¢ ) -|VH « )¡HÌ; « >
value of ® is about > 3 , achieved for > . 4
B–1 Let (resp. s ) denote the set of red (resp. black) H- (±
),+ - (R± ;=),R+
o It follows that 4 3 and « 3
squares
o, ino[ such ) a coloring, and for Ás , let o
G /4Â 4 denote the number written in square , is the unique solution satisfying the given equations.
_Ã o, o[Ã ;)
where G
o,
Â / . Then it is clear
o
that the ;%),+ @ @ ; )[+M¢ ),+ @
value of G o, depends only on the row of , while o
the B–3 Since N
)[+M¢
3 N N 4

and N 4 3
@
value of Â depends only on the column of . Since N 4 N 4 , we have that ÍT/?Î N if and only if
This is trial version 2
www.adultpdf.com
@ ; )Ã Ã @
NÄ N 4 / N 4Ä N . Hence
Ä injective. Since Â is also continuous, Â is either strictly
increasing or strictly decreasing.
H
Moreover, Â cannot
'Ð 7 'Ð 'Ð 7 'Ð
½ 3CÏ 4 3 Ï ½ 3CÏ 4 3 Ï tendHPtoa;
finite limit ® as
H<*H
4 , or else we’d have
L
3 ' K L
É L K
3 ' Â Â Â , with the left side bounded and
' ( Ä ( : ' Ñ 'Ä Ð
ÏÉK Ò K K K the right side unbounded.
HÞ;
Similarly, Â cannot tend to a
7 finite limit as . Together with monotonicity,
½ 3 4 3
this yields that Â is also surjective.
KÉL
Ä ( '
LK Ò K 3 ' H H eß
7 #(
K K K Ò K K Ò K
Pick ³ arbitrary, H
andHdefine
' for all /
_ H
recur-
½ 7 7 ; 7 7 sively by '#( Â ' for /0 , and ':79(
3 4 3 3 3 7#( H _ Þ
@
¢
R
+
KÉL Â ' for /jà . Let n¹( 4 d 4 3
Ä (
"; @ ¢ R+
KCÓÔK KCÓÔK and n @
H @ ; HX;e¥£_
d 4 3 and n @ be the roots of
_ )
½ 7 7 @Õ ; 7 @Õ , so that n ( 0
KÉL 3 3 gn,ã @ and
0á 0
Ä ( Ä nM( 0 n @ . Then there exist âÉ( â @ such that
H ' ' ^ß
K.ÓK K.ÓÔK ' â ( n ( 4â@,n @ for all / .
½ 7 7 @Õ ; ½ 7 7 @Õ ä
¦ _
KÉL 3 K L
É 3 Suppose Â H is strictly H
increasing. If â,@ for some
'
-
( D choice of ³ , then ' is dominated H
by
H
n @ for / suffi-
> ciently negative. But taking ' and ' @ for _
/ suffi-
H
ciently
H negative
H of the
H right parity, we get à '= à
Alternate Ó the sum as solution: rewrite
Ó ' @ but Â ' 0%Â ' @ , contradiction. Thus â @
Ö L ¦ Ö L _ H H H H
'½ ( )3
7 '
. Note that Í²/?Î Ï
' Ð Õ
4 '½ ( 3
7 ':7
Ï
'Ð Õ ; sinceH ³ âÉ( and ( âÉ(nM( , we have Â n¹(
a @ a a for e all_ . Analogously, if Â is strictly decreasing, then
Î if and only if /
Í²/Z4 4 for some . H '
;
Thus /4=ÍT/?Î and / Í²/?Î each increase by 1 except at â@ or else ' is H dominated H
by n ( for / sufficiently
a @
/ 4
a
, where the former skips from a @ 4 3 a to positive. But taking ' and ' @ _ for / H sufficiently H
pos-
a @ a a @ itive of the right parity, we get à ' @Ëà ' but
4 3 4 3 and the latter repeats the value . Thus H H
theÄ sums are Ä Ä Ä Â ' @ àÂ ' , contradiction. Thus in that case,
HP¾ H H
Â n,@ for all .
Ò Ò
½ 7P' ; ½ 7P\ ½ 7P' ½ 7P\ )=-
L 3 L 3 4 L 3 4 L 3 3 4 > B–6 Yes, there must exist infinitely many such
/ . Let
º_
be
³
' ( \ ( ' \ ( the convex hull of the set of points / ' for / .
+.Ø
Geometrically, is the intersection of all convex sets
B–4 For a rational number +.× ØM expressed
in Ø:lowest

terms, (or even all halfplanes)
containing the H#points
«
/ ' ;
define +.its height Ù × to be × 4 . Then for algebraically, is the
set

of points K K which

can
Øj
any × +.ØMR^ Ø expressed in lowest terms, we have be written
K
as â ( / ( :
' å 4 Y,Y[Y 4â /
' æ for some
@ ; @ Ø:
Ù G × × 4 × ; since by assumption â[( >[>,> â which are nonnegative of sum 1.
Ø *
¦ Ø:
× and are nonzero integers with × , we have We prove that for infinitely many / , / ' is a vertex

+CØMR; +CØM¾ Ø @ ; @ Ø:; ; Ø: on the upper boundary of , and that these
/ satisfy the
Ù G × Ù × × 4 × ×
º- : Ø ;= [;= Ø: given condition. The condition

that / ' is a vertex
4 × × on the upper boundary of is equivalent
to the exis-
[;), Ø:;)[ º
× 4 3 3 > tence of a line passing through / ' with all other _
Ó points of below it. That is, there should exist a 0
' ¾
It follows that G Õ consists solely of numbers of such that
height strictly larger than 3 /4 3 , and hence K a ; ç ºe)
Ó à ' 4 N / N > (1)
Ú L ' Õ ¾ Û
'½ ( G > ä)
We
K +
first
`_
show that
ä
/ satisfies (1).
K ; The condition
+: ;m),
_
N as N implies that
f K ;5 R+8 ;),
( N
Note: many choices for the height function are+.possible:
+.ØM
*^ÜMÝ| ÔM Ø: ØM as well. Thus the set ( N i has an upper
one can take Ù × × , or Ù × Ø equal K Ã= ;),
bound a , and now ( 4
a N , as desired.
to the total number of prime factors of × and , and so
on. The key properties of the height function are that Next, we show that given one / satisfying (1), there
on one hand, there are only finitely many rationals with exists a larger
K +
one_ also satisfying
(1). Again, the con-
K ;
height below any finite bound, and on the other hand, dition
R+: ;
N
Z _
as N

implies that
the height function is a sufficiently “algebraic” function ' N
f K ;Ì +: ;
/
K.è
as N . Thus the sequence
+CØ
of its argument that one can relate the heights of × ' N / i ' has a maximum element; sup-
+.ØM
and G × . pose N n is the largest value of N that achieves this
hCé!;¥ +: ;
a
H<
maximum, and put ' n / . Then the
K
« « HR< R é, a
B–5 Note that Â H «
implies that Â Â
Â Â Â line through n of slope lies strictly above N K
and hence from the given equation. That is, Â is for N 0*n and passes through or lies above N for
www.adultpdf.com
a ë). ;h) ;
N àhn . Thus (1) holds for / n with replaced by for Q >,>[> / , the points / Q '87 O and
a ;Ëê ê _

for suitably small 0 . /4mQ ' O lie below the line through / ' of; slope
a a a
. That means ' O à ' 4

Q and '87 O à

' Q;
By induction, we have that (1) holds for infinitely
_
many adding these together gives ':7 O 4 ' O à 3 ' , as de-
a sired.
/ . For any such / there exists 0 such that
www.adultpdf.com
Solutions to the 63rd William Lowell Putnam Mathematical Competition
Kiran Kedlaya and Lenny Ng
A1 By differentiating Pn (x)/(xk − 1)n+1 , we find that A4 (partly due to David Savitt) Player 0 wins with opti-
Pn+1 (x) = (xk − 1)Pn0 (x) − (n + 1)kxk−1 Pn (x); sub- mal play. In fact, we prove that Player 1 cannot prevent
stituting x = 1 yields Pn+1 (1) = −(n + 1)kPn (1). Player 0 from creating a row of all zeroes, a column of
Since P0 (1) = 1, an easy induction gives Pn (1) = all zeroes, or a 2 × 2 submatrix of all zeroes. Each of
(−k)n n! for all n ≥ 0. these forces the determinant of the matrix to be zero.
Note: one can also argue by expanding in Taylor series For i, j = 1, 2, 3, let Aij denote the position in row i
around 1. Namely, we have and column j. Without loss of generality, we may as-
sume that Player 1’s first move is at A11 . Player 0 then
1 1 1 plays at A22 :
= = (x − 1)−1 + · · · ,
xk − 1 k(x − 1) + · · · k  
1 ∗ ∗
so ∗ 0 ∗
dn 1 (−1)n n! ∗ ∗ ∗
=
n k
dx x − 1 k(x − 1)−n−1 After Player 1’s second move, at least one of A23 and
and A32 remains vacant. Without loss of generality, assume
A23 remains vacant; Player 0 then plays there.
dn 1 After Player 1’s third move, Player 0 wins by playing at
Pn (x) = (xk − 1)n+1
dxn xk − 1 A21 if that position is unoccupied. So assume instead
= (k(x − 1) + · · · )n+1 that Player 1 has played there. Thus of Player 1’s three

(−1)n n!
moves so far, two are at A11 and A21 . Hence for i equal
(x − 1)−n−1 + · · · to one of 1 or 3, and for j equal to one of 2 or 3, the
k
following are both true:
= (−k)n n! + · · · .
(a) The 2 × 2 submatrix formed by rows 2 and i and
A2 Draw a great circle through two of the points. There are by columns 2 and 3 contains two zeroes and two
two closed hemispheres with this great circle as bound- empty positions.
ary, and each of the other three points lies in one of (b) Column j contains one zero and two empty posi-
them. By the pigeonhole principle, two of those three tions.
points lie in the same hemisphere, and that hemisphere
thus contains four of the five given points. Player 0 next plays at Aij . To prevent a zero column,
Player 1 must play in column j, upon which Player 0
Note: by a similar argument, one can prove that among completes the 2 × 2 submatrix in (a) for the win.
any n+3 points on an n-dimensional sphere, some n+2
of them lie on a closed hemisphere. (One cannot get by Note: one can also solve this problem directly by mak-
with only n + 2 points: put them at the vertices of a reg- ing a tree of possible play sequences. This tree can be
ular simplex.) Namely, any n of the points lie on a great considerably collapsed using symmetries: the symme-
sphere, which forms the boundary of two hemispheres; try between rows and columns, the invariance of the
of the remaining three points, some two lie in the same outcome under reordering of rows or columns, and the
hemisphere. fact that the scenario after a sequence of moves does
not depend on the order of the moves (sometimes called
A3 Note that each of the sets {1}, {2}, . . . , {n} has the “transposition invariance”).
desired property. Moreover, for each set S with in- Note (due to Paul Cheng): one can reduce Determi-
teger average m that does not contain m, S ∪ {m} nant Tic-Tac-Toe to a variant of ordinary tic-tac-toe.
also has average m, while for each set T of more than Namely, consider a tic-tac-toe grid labeled as follows:
one element with integer average m that contains m,
T \{m} also has average m. Thus the subsets other than A11 A22 A33
{1}, {2}, . . . , {n} can be grouped in pairs, so Tn − n is A23 A31 A12
even. A32 A13 A21

www.adultpdf.com
Then each term in the expansion of the determinant oc- For b = 2, we have a slightly different identity because
curs in a row or column of the grid. Suppose Player f (2) 6= 2f (2). Instead, for any positive integer i, we
1 first plays in the top left. Player 0 wins by playing have
first in the top row, and second in the left column. Then
i d
there are only one row and column left for Player 1 to 2X −1 i −1
2X
1 1 1 X 1 1
threaten, and Player 1 cannot already threaten both on =1+ + + . (2)
f (n) 2 6 f (d) n
the third move, so Player 0 has time to block both. n=1 d−1
d=3 n=2
A5 It suffices to prove that for any relatively prime positive Again comparing an integral to a Riemann sum, we see
integers r, s, there exists an integer n with an = r and that for d ≥ 3,
an+1 = s. We prove this by induction on r + s, the case d
2X −1 2d
r + s = 2 following from the fact that a0 = a1 = 1.
Z
1 1 1 dx
Given r and s not both 1 with gcd(r, s) = 1, we must < d−1 − d +
n 2 2 2d−1 x
have r 6= s. If r > s, then by the induction hypothesis n=2d−1
we have an = r − s and an+1 = s for some n; then 1
= + log 2
a2n+2 = r and a2n+3 = s. If r < s, then we have 2d
an = r and an+1 = s − r for some n; then a2n+1 = r 1
≤ + log 2 < 0.125 + 0.7 < 1.
and a2n+2 = s. 8
Note: a related problem is as follows. Starting with the 1
Put c = +log 2 and L = 1+ 12 + 6(1−c)
8
1
. Then we can
sequence i
P2 −1 1
prove that n=1 f (n) < L for all i ≥ 2 by induction
0 1 on i. The case i = 2 is clear. For the induction, note
, ,
1 0 that by (2),
repeat the following operation: insert between each pair i
2X −1 i
a c a+c 1 1 1 X 1
b and d the pair b+d . Prove that each positive rational <1+ + +c
number eventually appears. f (n) 2 6 f (d)
n=1 d=3
Observe that by induction, if ab and dc are consecutive 1 1 1
terms in the sequence, then bc − ad = 1. The same <1+ + +c
2 6 6(1 − c)
holds for consecutive terms of the n-th Farey sequence, 1 1
the sequence of rational numbers in [0, 1] with denomi- =1+ + = L,
2 6(1 − c)
nator (in lowest terms) at most n.
P∞ 1
A6 The sum converges for b = 2 and diverges for b ≥ 3. as desired. We conclude that n=1 f (n) converges to a
We first consider b ≥ 3. Suppose the sum converges; limit less than or equal to L.
then the fact that f (n) = nf (d) whenever bd−1 ≤ n ≤ Note: the above argument proves that the sum for b = 2
bd − 1 yields is at most L < 2.417. One can also obtain a lower
d
bound by the same technique, namely 1 + 12 + 6(1−c 1
0)
∞ ∞ −1
bX
X 1 X 1 1 with c0 = log 2. This bound exceeds 2.043. (By con-
= . (1)
f (n) f (d) n trast, summing the first 100000 terms of the series only
n=1 d−1
d=1 n=b
yields a lower bound of 1.906.) Repeating the same ar-
However, by comparing the integral of 1/x with a Rie- guments with d ≥ 4 as the cutoff yields the upper bound
mann sum, we see that 2.185 and the lower bound 2.079.
d
bX −1 Z bd
B1 The probability is 1/99. In fact, we show by induc-
1 dx tion on n that after n shots, the probability of having
>
n bd−1 x made any number of shots from 1 to n − 1 is equal to
n=bd−1
1/(n − 1). This is evident for n = 2. Given the result
= log(bd ) − log(bd−1 ) = log b, for n, we see that the probability of making i shots after
n + 1 attempts is
where log denotes the natural logarithm. Thus (1) yields

∞ ∞
i−1 1 i 1 (i − 1) + (n − i)
1 1 + 1− =
n n−1 n n−1 n(n − 1)
X X
> (log b) ,
n=1
f (n) n=1
f (n) 1
= ,
n
a contradiction since log b > 1 for b ≥ 3. Therefore the
sum diverges. as claimed.

www.adultpdf.com
B2 (Note: the problem statement assumes that all polyhe- which is evident because the inequalities hold term by
dra are connected and that no two edges share more than term.
one face, so we will do likewise. In particular, these are Note: David Savitt points out that the upper bound can
true for all convex polyhedra.) We show that in fact be improved from 1/(ne) to 2/(3ne) with a slightly
the first player can win on the third move. Suppose the more complicated argument. (In fact, for any c > 1/2,
polyhedron has a face A with at least four edges. If the one has an upper bound of c/(ne), but only for n above
first player plays there first, after the second player’s a certain bound depending on c.)
first move there will be three consecutive faces B, C, D
adjacent to A which are all unoccupied. The first player B4 Use the following strategy: guess 1, 3, 4, 6, 7, 9, . . . un-
wins by playing in C; after the second player’s second til the target number n is revealed to be equal to or lower
move, at least one of B and D remains unoccupied, and than one of these guesses. If n ≡ 1 (mod 3), it will be
either is a winning move for the first player. guessed on an odd turn. If n ≡ 0 (mod 3), it will be
It remains to show that the polyhedron has a face with at guessed on an even turn. If n ≡ 2 (mod 3), then n + 1
least four edges. (Thanks to Russ Mann for suggesting will be guessed on an even turn, forcing a guess of n on
the following argument.) Suppose on the contrary that the next turn. Thus the probability of success with this
each face has only three edges. Starting with any face strategy is 1335/2002 > 2/3.
F1 with vertices v1 , v2 , v3 , let v4 be the other endpoint Note: for any positive integer m, this strategy wins
of the third edge out of v1 . Then the faces adjacent to F1 when the number is being guessed from [1, m] with
must have vertices v1 , v2 , v4 ; v1 , v3 , v4 ; and v2 , v3 , v4 . probability m 1 2m+1
b 3 c. We can prove that this is best
Thus v1 , v2 , v3 , v4 form a polyhedron by themselves, possible as follows. Let am denote m times the proba-
contradicting the fact that the given polyhedron is con- bility of winning when playing optimally. Also, let bm
nected and has at least five vertices. (One can also de- denote m times the corresponding probability of win-
duce this using Euler’s formula V − E + F = 2 − 2g, ning if the objective is to select the number in an even
where V, E, F are the numbers of vertices, edges and number of guesses instead. (For definiteness, extend the
faces, respectively, and g is the genus of the polyhe- definitions to incorporate a0 = 0 and b0 = 0.)
dron. For a convex polyhedron, g = 0 and you get the
“usual” Euler’s formula.) We first claim that am = 1+max1≤k≤m {bk−1 +bm−k }
and bm = max1≤k≤m {ak−1 + am−k } for m ≥ 1. To
Note: Walter Stromquist points out the following coun-
establish the first recursive identity, suppose that our
terexample if one relaxes the assumption that a pair of
first guess is some integer k. We automatically win if
faces may not share multiple edges. Take a tetrahedron
n = k, with probability 1/m. If n < k, with proba-
and remove a smaller tetrahedron from the center of an
bility (k − 1)/m, then we wish to guess an integer in
edge; this creates two small triangular faces and turns
[1, k − 1] in an even number of guesses; the probabil-
two of the original faces into hexagons. Then the sec-
ity of success when playing optimally is bk−1 /(k − 1),
ond player can draw by signing one of the hexagons,
by assumption. Similarly, if n < k, with probability
one of the large triangles, and one of the small trian-
(m − k)/m, then the subsequent probability of winning
gles. (He does this by “mirroring”: wherever the first
is bm−k /(m − k). In sum, the overall probability of
player signs, the second player signs the other face of
winning if k is our first guess is (1 + bk−1 + bm−k )/m.
the same type.)
For optimal strategy, we choose k such that this quan-
B3 The desired inequalities can be rewritten as tity is maximized. (Note that this argument still holds
if k = 1 or k = m, by our definitions of a0 and b0 .)
1 1 1 The first recursion follows, and the second recursion is
1 − < exp 1 + n log 1 − <1− .
n n 2n established similarly.
By taking logarithms, we can rewrite the desired in- We now prove by induction that am = b(2m + 1)/3c
equalities as and bm = b2m/3c for m ≥ 0. The inductive step relies
on the inequality bxc + byc ≤ bx + yc, with equal-
ity when one of x, y is an integer. Now suppose that

1 1
− log 1 − < −1 − n log 1 − ai = b(2i + 1)/3c and bi = b2i/3c for i < m. Then
2n n

1
2(k − 1)

2(m − k)

< − log 1 − . 1 + bk−1 + bm−k = 1 + +
n 3 3

Rewriting these in terms of the Taylor expansion of 2m
≤
− log(1−x), we see that the desired result is also equiv- 3
alent to
∞ ∞ ∞ and similarly ak−1 + am−k ≤ b(2m + 1)/3c, with
X 1 X 1 X 1
equality in both cases attained, e.g., when k = 1. The
i i
< i
< ,
i=1
i2 n i=1
(i + 1)n i=1
ini inductive formula for am and bm follows.

www.adultpdf.com
B5 (due to Dan Bernstein) Put N = 2002!. Then for side. Moreover, both sides have the same leading coef-
d = 1, . . . , 2002, the number N 2 written in base b = ficient. Since they both have degree only p, they must
N/d − 1 has digits d2 , 2d2 , d2 . (Note that these really then coincide.
are digits because 2(2002)2 < (2002!)2 /2002 − 1.) We thus have
Note: one can also produce an integer N which has base p−1 p−1
b digits 1, ∗, 1 for n different values of b, as follows. Y Y
x (y + ix) (z + ix + jy)
Choose c with 0 < c < 21/n . For m a large positive
i=0 i,j=0
integer, put N = 1 + (m + 1) · · · (m + n)bcmcn−2 . For
p−1
m sufficiently large, the bases Y
≡ x(y p − xp−1 y) ((z + jy)p − xp−1 (z + jy))
N −1 Y j=0
b= n−2
= (m + j) p−1
(m + i)m
j6=i
Y
≡ (xy p − xp y) (z p − xp−1 z + jy p − jxp−1 y)
j=0
for i = 1, . . . , n will have the properties that N ≡ 1
(mod b) and b2 < N < 2b2 for m sufficiently large. ≡ (xy − x y)((z p − xp−1 z)p
p p
Note (due to Russ Mann): one can also give a “noncon- − (y p − xp−1 y)p−1 (z p − xp−1 z))
structive” argument. Let N be a large positive integer. 2 2
−p p
≡ (xy p − xp y)(z p − xp z )
For b ∈ (N 2 , N 3 ), the number of 3-digit base-b palin-
p p−1
dromes in the range [b2 , N 6 − 1] is at least − x(y − x y) (z − xp−1 z)
p p
2 2 2 2
−p+1 p p
6 ≡ xy p z p − xp yz p − xp y z + xp yz p
N − b2 N6

− 1 ≥ 2 − b − 2, 2 2
−p+1 p p 2 2
b b − xy p z p + xp y z + xp y p z − xp y p z
2 2 2
since there is a palindrome in each interval [kb, (k + ≡ xy p z p + yz p xp + zxp y p

2 2 2
1)b − 1] for k = b, . . . , b2 − 1. Thus the average num- − xz p y p − yxp z p − zy p xp ,
ber of bases for which a number in [1, N 6 − 1] is at
least which is precisely the desired determinant.
3
NX −1
Note: a simpler conceptual proof is as follows. (Ev-
N6

1 erything in this paragraph will be modulo p.) Note
− b − 2 ≥ log(N ) − c
N6 b that for any integers a, b, c, the column vector [ax +
b=N 2 +1 2
by + cz, (ax + by + cz)p , (ax + by + cz)p ] is a linear
for some constant c > 0. Take N so that the right side combination of the columns of the given matrix. Thus
exceeds 2002; then at least one number in [1, N 6 − 1] ax+by+cz divides the determinant. In particular, all of
is a base-b palindrome for at least 2002 values of b. the factors of (3) divide the determinant; since both (3)
and the determinant have degree p2 + p + 1, they agree
B6 We prove that the determinant is congruent modulo p to up to a scalar multiple. Moreover, they have the same
2
p−1 p−1
coefficient of z p y p x (since this term only appears in
Y Y the expansion of (3) when you choose the first term in
x (y + ix) (z + ix + jy). (3)
each factor). Thus the determinant is congruent to (3),
i=0 i,j=0
as desired.
We first check that Either argument can be used to generalize to a corre-
sponding n × n determinant, called a Moore determi-
p−1
Y nant; we leave the precise formulation to the reader.
(y + ix) ≡ y p − xp−1 y (mod p). (4) Note the similarity with the classical Vandermonde de-
i=0
terminant: if A is the n × n matrix with Aij = xji for
Since both sides are homogeneous as polynomials in x i, j = 0, . . . , n − 1, then
and y, it suffices to check (4) for x = 1, as a congru- Y
ence between polynomials. Now note that the right side det(A) = (xj − xi ).
has 0, 1, . . . , p − 1 as roots modulo p, as does the left 1≤i<j≤n

www.adultpdf.com
Solutions to the 64th William Lowell Putnam Mathematical Competition
A1 There are n such sums. More precisely, there is exactly the left. Thus AM-GM shows that the terms under con-
one such sum with k terms for each of k = 1, . . . , n sideration on the left exceed those on the right; adding
(and clearly no others). To see this, note that if n = these inequalities over all k yields the desired result.
a1 + a2 + · · · + ak with a1 ≤ a2 ≤ · · · ≤ ak ≤ a1 + 1, Third solution: Since both sides are continuous in each
then ai , it is sufficient to prove the claim with a1 , . . . , an all
positive (the general case follows by taking limits as
ka1 = a1 + a1 + · · · + a1 some of the ai tend to zero). Put ri = bi /ai ; then the
≤ n ≤ a1 + (a1 + 1) + · · · + (a1 + 1) given inequality is equivalent to
= ka1 + k − 1.
(1 + r1 )1/n · · · (1 + rn )1/n ≥ 1 + (r1 · · · rn )1/n .
However, there is a unique integer a1 satisfying these
inequalities, namely a1 = bn/kc. Moreover, once a1 In terms of the function
is fixed, there are k different possibilities for the sum
a1 + a2 + · · · + ak : if i is the last integer such that f (x) = log(1 + ex )
ai = a1 , then the sum equals ka1 + (i − 1). The pos-
and the quantities si = log ri , we can rewrite the de-
sible values of i are 1, . . . , k, and exactly one of these
sired inequality as
sums comes out equal to n, proving our claim.

Note: In summary, there is a unique partition of n with 1 s1 + · · · + sn
(f (s1 ) + · · · + f (sn )) ≥ f .
k terms that is “as equally spaced as possible”. One n n
can also obtain essentially the same construction induc-
tively: except for the all-ones sum, each partition of n This will follow from Jensen’s inequality if we can ver-
is obtained by “augmenting” a unique partition of n−1. ify that f is a convex function; it is enough to check that
f 00 (x) > 0 for all x. In fact,
A2 First solution: Assume without loss of generality that
ai + bi > 0 for each i (otherwise both sides of the de- ex 1
f 0 (x) = =1−
sired inequality are zero). Then the AM-GM inequality 1 + ex 1 + ex
gives
is an increasing function of x, so f 00 (x) > 0 and

a1 · · · an
1/n Jensen’s inequality thus yields the desired result. (As
long as the ai are all positive, equality holds when
(a1 + b1 ) · · · (an + bn ) s1 = · · · = sn , i.e., when the vectors (a1 , . . . , an ) and

1 a1 an (b1 , . . . , bn ). Of course other equality cases crop up if
≤ + ··· + ,
n a1 + b1 an + bn some of the ai vanish, i.e., if a1 = b1 = 0.)
Fourth solution: We apply induction on n, the case
and likewise with the roles of a and b reversed. Adding
n = 1 being evident. First we verify the auxiliary in-
these two inequalities and clearing denominators yields
equality
the desired result.
Second solution: Write the desired inequality in the (an + bn )(cn + dn )n−1 ≥ (acn−1 + bdn−1 )n
form
for a, b, c, d ≥ 0. The left side can be written as
(a1 +b1 ) · · · (an +bn ) ≥ [(a1 · · · an )1/n +(b1 · · · bn )1/n ]n ,
an cn(n−1) + bn dn(n−1)
expand both sides, and compare the terms on both n−1
X n − 1
sides in which k of the terms are among the + an cni dn(n−1−i)
ai . On the left, one has the product of each k- i=1
i
element subset of {1, . . . , n}; on the right, one has n−1
X n − 1
n
bn cn(n−i) dn(i−1) .
k/n
k (a1 · · · an ) · · · (b1 . . . bn )(n−k)/n , which is pre- +
n i − 1
cisely k times the geometric mean of the terms on i=1

www.adultpdf.com
Applying the weighted AM-GM inequality between 1 − 2/(c − 1)2 , which
√ vanishes when (c − 1)2 =√ 2, i.e.,
matching terms in the two sums yields where c = 1 ± 2. Only the value c =√1 − 2 is in
bounds, at which the value of f is 1 − 2 2 > −1.83.
(an + bn )(cn + dn )n−1 As for the pole at c = 1, we observe that f decreases
≥ an cn(n−1) + bn dn(n−1) as c approaches from below (so takes negative values
n−1
for all c < 1) and increases as c approaches from above
X n (so takes positive values for all c > 1); from the data
+ ai bn−i c(n−1)i d(n−1)(n−i) ,
i collected so far, we see that f has no sign crossings, so
i=1
the minimum of |f | is achieved at a critical
√ point of f .
proving the auxiliary inequality. We conclude that the minimum of |f | is 2 2 − 1.
Now given the auxiliary inequality and the n−1 case of Alternate derivation (due to Zuming Feng): We can also
the desired inequality, we apply the auxiliary inequality minimize |c + 2/(c − 1)| without calculus (or worrying
1/n 1/n about boundary conditions). For c > 1, we have
with a = a1 , b = b1 , c = (a2 · · · an )1/n(n−1) ,
d = (b2 . . . bn )1/n(n−1) . The right side will be the n-th 2 √
power of the desired inequality. The left side comes out 1 + (c − 1) + ≥1+2 2
c−1
to
by AM-GM √ on the last two terms, with equality for
(a1 + b1 )((a2 · · · an )1/(n−1) + (b2 · · · bn )1/(n−1) )n−1 , c − 1 = 2 (which is out of range). For c < 1, we
similarly have
and by the induction hypothesis, the second factor is
less than (a2 + b2 ) · · · (an + bn ). This yields the de- 2 √
sired result. −1 + 1 − c + ≥ −1 + 2 2,
1−c
Note: Equality holds if and only if ai = bi = 0 for √
some i or if the vectors (a1 , . . . , an ) and (b1 , . . . , bn ) here with equality for 1 − c = 2.
are proportional. As pointed out by Naoki Sato, the Second solution: Write
problem also appeared on the 1992 Irish Mathematical
1 a+b
Olympiad. It is also a special case of a classical in- f (a, b) = a + b + + .
equality, known as Hölder’s inequality, which general- ab ab
izes the Cauchy-Schwarz inequality (this is visible from Then the problem is to minimize |f (a, b)| subject to the
the n = 2 case); the first solution above is adapted from constraint a2 + b2 − 1 = 0. Since the constraint re-
the standard proof of Hölder’s inequality. We don’t gion has no boundary, it is enough to check the value
know whether the declaration “Apply Hölder’s inequal- at each critical point and each potential discontinuity
ity” by itself is considered an acceptable solution to this (i.e., where ab = 0) and select the smallest value (after
problem. checking that f has no sign crossings).
A3 First solution: Write We locate the critical points using the Lagrange mul-
tiplier condition: the gradient of f should be parallel
f (x) = sin x + cos x + tan x + cot x + sec x + csc x to that of the constraint, which is to say, to the vector
1 sin x + cos x (a, b). Since
= sin x + cos x + + .
sin x cos x sin x cos x ∂f 1 1
√ =1− 2 − 2
We can write sin x + cos x = 2 cos(π/4 − x); this ∂a a b a
suggests making the substitution y = π/4 − x. In this and similarly for b, the proportionality yields
new coordinate,
a2 b3 − a3 b2 + a3 − b3 + a2 − b2 = 0.
1 1
sin x cos x = sin 2x = cos 2y,
2 2 The irreducible factors of the left side are 1 + a, 1 + b,
√ a − b, and ab − a − b. So we must check what happens
and writing c = 2 cos y, we have when any of those factors, or a or b, vanishes.
If 1 + a = 0, then b = 0, and the singularity of f be-

2
f (y) = (1 + c) 1 + 2 −1 comes removable when restricted to the circle. Namely,
c −1
2 we have
=c+ .
c−1 1 b+1
f =a+b+ +
a ab
We√ must √ of c √
√ analyze this function in the range
[− 2, 2]. Its
√ value at c =
√ − 2 is 2 − 3 2 < −2.24, and a2 +b2 −1 = 0 implies (1+b)/a = a/(1−b). Thus
and at c = 2 is 2 + 3 2 > 6.24. Its derivative is we have f = −2; the same occurs when 1 + b = 0.

www.adultpdf.com
√
If a − b √
= 0, then a = b = √ ± 2/2 and either ellipse ax2 + bxy + cy 2 = 1, and their respective en-
f = 2 + 3 2 > 6.24, or f = 2 − 3 2 < −2.24. closed areas are π/(4AC − B 2 ) and π/(4ac − b2 ).
If a = 0, then either b = −1 as discussed above, or Case 3: B 2 − 4AC ≤ 0 and b2 − 4ac > 0. Since
b = 1. In the latter case, f blows up as one approaches Ax2 + Bx + C has a graph not crossing the x-axis, so
this point, so there cannot be a global minimum there. do (Ax2 + Bx + C) ± (ax2 + bx + c). Thus
Finally, if ab − a − b = 0, then (B − b)2 − 4(A − a)(C − c) ≤ 0,
a2 b2 = (a + b)2 = 2ab + 1 (B + b)2 − 4(A + a)(C + c) ≤ 0
√
and so ab = 1 ± 2. The √ plus sign is impossible since and adding these together yields
|ab| ≤ 1, so ab = 1 − 2 and
2(B 2 − 4AC) + 2(b2 − 4ac) ≤ 0.
1
f (a, b) = ab + +1 Hence b2 − 4ac ≤ 4AC − B 2 , as desired.
ab
√
= 1 − 2 2 > −1.83. A5 First solution: We represent a Dyck n-path by a se-
quence a1 · · · a2n , where each ai is either (1, 1) or
This yields the smallest value of |f | in the
√list (and in- (1, −1).
deed no sign crossings are possible), so 2 2 − 1 is the
desired minimum of |f |. Given an (n − 1)-path P = a1 · · · a2n−2 , we
distinguish two cases. If P has no returns
Note: Instead of using the geometry of the graph of f of even-length, then let f (P ) denote the n-path
to rule out sign crossings, one can verify explicitly that (1, 1)(1, −1)P . Otherwise, let ai ai+1 · · · aj denote the
f cannot take the value 0. In the first solution, note that rightmost even-length return in P , and let f (P ) =
c + 2/(c − 1) = 0 implies c2 − c + 2 = 0, which has (1, 1)a1 a2 · · · aj (1, −1)aj+1 · · · a2n−2 . Then f clearly
no real roots. In the second solution, we would have maps the set of Dyck (n − 1)-paths to the set of Dyck
n-paths having no even return.
a2 b + ab2 + a + b = −1.
We claim that f is bijective; to see this, we simply
Squaring both sides and simplifying yields construct the inverse mapping. Given an n-path P , let
R = ai ai+1 ...aj denote the leftmost return in P , and
2a3 b3 + 5a2 b2 + 4ab = 0, let g(P ) denote the path obtained by removing a1 and
aj from P . Then evidently f ◦ g and g ◦ f are identity
whose only real root is ab = 0. But the cases with maps, proving the claim.
ab = 0 do not yield f = 0, as verified above.
Second solution: (by Dan Bernstein) Let Cn be the
A4 We split into three cases. Note first that |A| ≥ |a|, by number of Dyck paths of length n, let On be the num-
applying the condition for large x. ber of Dyck paths whose final return has odd length,
Case 1: B 2 − 4AC > 0. In this case Ax2 + Bx + C and let Xn be the number of Dyck paths with no return
has two distinct real roots r1 and r2 . The condition im- of even length.
plies that ax2 + bx + c also vanishes at r1 and r2 , so We first exhibit a recursion for On ; note that O0 = 0.
b2 − 4ac > 0. Now Given a Dyck n-path whose final return has odd length,
split it just after its next-to-last return. For some k (pos-
B 2 − 4AC = A2 (r1 − r2 )2 sibly zero), this yields a Dyck k-path, an upstep, a Dyck
≥ a2 (r1 − r2 )2 (n − k − 1)-path whose odd return has even length, and
a downstep. Thus for n ≥ 1,
= b2 − 4ac.
n−1
X
Case 2: B 2 − 4AC ≤ 0 and b2 − 4ac ≤ 0. As- On = Ck (Cn−k−1 − On−k−1 ).
sume without loss of generality that A ≥ a > 0, and k=0
that B = 0 (by shifting x). Then Ax2 + Bx + C ≥
ax2 + bx + c ≥ 0 for all x; in particular, C ≥ c ≥ 0. We next exhibit a similar recursion for Xn ; note that
Thus X0 = 1. Given a Dyck n-path with no even return,
splitting as above yields for some k a Dyck k-path with
4AC − B 2 = 4AC no even return, an upstep, a Dyck (n−k−1)-path whose
≥ 4ac final return has even length, then a downstep. Thus for
n ≥ 1,
≥ 4ac − b2 .
n−1
X
Alternate derivation (due to Robin Chapman): the el- Xn = Xk (Cn−k−1 − On−k−1 ).
lipse Ax2 + Bxy + Cy 2 = 1 is contained within the k=0

www.adultpdf.com
To conclude, we verify that Xn = Cn−1 for n ≥ 1, sets, then f (p) + f (q) = 0. In other words,
by induction on n. This is clear for n = 1 since X
X1 = C0 = 1. Given Xk = Ck−1 for k < n, we 2(rA (n) − rB (n)) = (f (p) + f (q))
have p+q=n,p<q
n−1 and it suffices to show that the sum onP

the right is always
X n
Xn = Xk (Cn−k−1 − On−k−1 ) zero. If n is odd, that sum is visibly i=0 f (i) = 0. If
k=0 n is even, the sum equals
n−1 !
X n
= Cn−1 − On−1 + Ck−1 (Cn−k−1 − On−k−1 )
X
f (i) − f (n/2) = f (n) − f (n/2) = 0.
k=1
i=0
= Cn−1 − On−1 + On−1
This yields the desired result.
= Cn−1 ,
Third solution: (by Dan P Bernstein) Put f (x) =
n n
P
as desired. n∈A x and g(x) = n∈B x ; then the value of
rA (n) (resp. rB (n)) is the coefficient of xn in f (x)2 −
Note: Since the problem only asked about the existence f (x2 ) (resp. g(x)2 −g(x2 )). From the evident identities
of a one-to-one correspondence, we believe that any
proof, bijective or not, that the two sets have the same 1
cardinality is an acceptable solution. (Indeed, it would = f (x) + g(x)
1−x
be highly unusual to insist on using or not using a spe- f (x) = f (x2 ) + xg(x2 )
cific proof technique!) The second solution above can
also be phrased in terms of generating functions. Also, g(x) = g(x2 ) + xf (x2 ),
the Cn are well-known to equal the Catalan numbers
1 2n we have
n+1 n ; the problem at hand is part of a famous exer-
cise in Richard Stanley’s Enumerative Combinatorics, f (x) − g(x) = f (x2 ) − g(x2 ) + xg(x2 ) − xf (x2 )
Volume 1 giving 66 combinatorial interpretations of the
Catalan numbers. = (1 − x)(f (x2 ) − g(x2 ))
f (x2 ) − g(x2 )
A6 First solution: Yes, such a partition is possible. To = .
f (x) + g(x)
achieve it, place each integer into A if it has an even
number of 1s in its binary representation, and into B We deduce that f (x)2 − g(x)2 = f (x2 ) − g(x2 ), yield-
if it has an odd number. (One discovers this by simply ing the desired equality.
attempting to place the first few numbers by hand and Note: This partition is actually unique, up to inter-
noticing the resulting pattern.) changing A and B. More precisely, the condition that
To show that rA (n) = rB (n), we exhibit a bijection be- 0 ∈ A and rA (n) = rB (n) for n = 1, . . . , m uniquely
tween the pairs (a1 , a2 ) of distinct elements of A with determines the positions of 0, . . . , m. We see this by
a1 + a2 = n and the pairs (b1 , b2 ) of distinct elements induction on m: given the result for m − 1, switching
of B with b1 + b2 = n. Namely, given a pair (a1 , a2 ) the location of m changes rA (m) by one and does not
with a1 + a2 = n, write both numbers in binary and change rB (m), so it is not possible for both positions to
find the lowest-order place in which they differ (such a work. Robin Chapman points out this problem is solved
place exists because a1 6= a2 ). Change both numbers in D.J. Newman’s Analytic Number Theory (Springer,
in that place and call the resulting numbers b1 , b2 . Then 1998); in that solution, one uses generating functions to
a1 + a2 = b1 + b2 = n, but the parity of the number of find the partition and establish its uniqueness, not just
1s in b1 is opposite that of a1 , and likewise between b2 verify it.
and a2 . This yields the desired bijection.
B1 No, there do not.
Second solution: (by Micah Smukler) Write b(n) for First solution: Suppose the contrary. By setting y =
the number of 1s in the base 2 expansion of n, and −1, 0, 1 in succession, we see that the polynomials
f (n) = (−1)b(n) . Then the desired partition can be 1 − x + x2 , 1, 1 + x + x2 are linear combinations of
described as A = f −1 (1) and B = f −1 (−1). Since a(x) and b(x). But these three polynomials are linearly
f (2n) + f (2n + 1) = 0, we have independent, so cannot all be written as linear combina-
n
( tions of two other polynomials, contradiction.
X 0 n odd Alternate formulation: the given equation expresses a
f (n) =
i=0
f (n) n even. diagonal matrix with 1, 1, 1 and zeroes on the diagonal,
which has rank 3, as the sum of two matrices of rank 1.
If p, q are both in A, then f (p) + f (q) = 2; if p, q are But the rank of a sum of matrices is at most the sum of
both in B, then f (p)+f (q) = −2; if p, q are in different the ranks of the individual matrices.

www.adultpdf.com
Second solution: It is equivalent (by relabeling and Note: The third solution only works over fields of char-
rescaling) to show that 1 + xy + x2 y 2 cannot
P be written acteristic not equal to 3, whereas the other two work
i
as
P ia(x)d(y) − b(x)c(y). Write a(x) = ai x , b(x) = over arbitrary fields. (In the first solution, one must re-
cj y j , d(y) = dj y j . We now start
P P
bi x , c(y) = place −1 by another value if working in characteristic
comparing coefficients of 1+xy +x2 y 2 . By comparing 2.)
coefficients of 1 + xy + x2 y 2 and a(x)d(y) − b(x)c(y),
B2 It is easy to see by induction that the j-th entry of
we get
the k-th sequence (where the original sequence is k =
Pk
1 = ai di − bi ci (i = 0, 1, 2) 1) is i=1 k−1 i−1 /(2
k−1
(i + j − 1)), and so xn =
1
P n n−1 n−1
n

0 = ai dj − bi cj (i 6= j). 2n−1 i=1 i−1 /i. Now i−1 /i = i /n; hence
n
The first equation says that ai and bi cannot both vanish, 1 X n 2n − 1
xn = n−1 = < 2/n,
and ci and di cannot both vanish. The second equation n2 i=1
i n2n−1
says that ai /bi = cj /dj when i 6= j, where both sides
should be viewed in R ∪ {∞} (and neither is undeter- as desired.
mined if i, j ∈ {0, 1, 2}). But then B3 First solution: It is enough to show that for each prime
p, the exponent of p in the prime factorization of both
a0 /b0 = c1 /d1 = a2 /b2 = c0 /d0 sides is the same. On the left side, it is well-known that
the exponent of p in the prime factorization of n! is
contradicting the equation a0 d0 − b0 c0 = 1. n
X n
Third solution: We work over the complex numbers, .
in which we have a primitive cube root ω of 1. We also i=1
pi
use without further comment unique factorization for (To see this, note that the i-th term counts the multiples
polynomials in two variables over a field. And we keep of pi among 1, . . . , n, so that a number divisible exactly
the relabeling of the second solution. by pi gets counted exactly i times.) This number can be
Suppose the contrary. Since 1 + xy + x2 y 2 = (1 − reinterpreted as the cardinality of the set S of points in
xy/ω)(1 − xy/ω 2 ), the rational function a(ω/y)d(y) − the plane with positive integer coordinates lying on or
b(ω/y)c(y) must vanish identically (that is, coefficient under the curve y = np−x : namely, each summand is
by coefficient). If one of the polynomials, say a, van- the number of points of S with x = i.
ished identically, then one of b or c would also, and the On the right side, the exponent of p in the prime
desired inequality could not hold. So none of them van- factorization of lcm(1, . . . , bn/ic) is blogp bn/icc =
ish identically, and we can write blogp (n/i)c. However, this is precisely the number of
points of S with y = i. Thus
c(y) a(ω/y)
= . n n
d(y) b(ω/y) X X n
blogp bn/icc = ,
i=1 i=1
pi
Likewise,
and the desired result follows.
c(y) a(ω 2 /y)
= . Second solution: We prove the result by induction on
d(y) b(ω 2 /y) n, the case n = 1 being obvious. What we actually
show is that going from n − 1 to n changes both sides
Put f (x) = a(x)/b(x); then we have f (ωx) = f (x) by the same multiplicative factor, that is,
identically. That is, a(x)b(ωx) = b(x)a(ωx). Since a
n−1
and b have no common factor (otherwise 1 + xy + x2 y 2 Y lcm{1, 2, . . . , bn/ic}
would have a factor divisible only by x, which it doesn’t n= .
i=1
lcm{1, 2, . . . , b(n − 1)/ic}
since it doesn’t vanish identically for any particular x),
a(x) divides a(ωx). Since they have the same degree, Note that the i-th term in the product is equal to 1 if n/i
they are equal up to scalars. It follows that one of is not an integer, i.e., if n/i is not a divisor of n. It is
a(x), xa(x), x2 a(x) is a polynomial in x3 alone, and also equal to 1 if n/i is a divisor of n but not a prime
likewise for b (with the same power of x). power, since any composite number divides the lcm of
If xa(x) and xb(x), or x2 a(x) and x2 b(x), are poly- all smaller numbers. However, if n/i is a power of p,
nomials in x3 , then a and b are divisible by x, but we then the i-th term is equal to p.
know a and b have no common factor. Hence a(x) and Since n/i runs over all proper divisors of n, the product
b(x) are polynomials in x3 . Likewise, c(y) and d(y) on the right side includes one factor of the prime p for
are polynomials in y 3 . But then 1 + xy + x2 y 2 = each factor of p in the prime factorization of n. Thus
a(x)d(y) − b(x)c(y) is a polynomial in x3 and y 3 , con- the whole product is indeed equal to n, completing the
tradiction. induction.

www.adultpdf.com
B4 First solution: Put g = r1 + r2 , h = r3 + r4 , u = r1 r2 , on [0, 1]. Define
v = r3 r4 . We are given that g is rational. The following
are also rational: E+ = {x ∈ [0, 1] : f (x) ≥ 0}
E− = {x ∈ [0, 1] : f (x) < 0};
−b
=g+h then E+ , E− are measurable and µ(E+ ) + µ(E− ) = 1.
a
c Write µ+ and µ− for µ(E+ ) and µ(E− ). Also define
= gh + u + v
a
Z
−d I+ = |f (x)| dx
= gv + hu E+
a Z
I− = |f (x)| dx,
From the first line, h is rational. From the second line, E−
u + v is rational. From the third line, g(u + v) − (gv + R1
hu) = (g − h)u is rational. Since g 6= h, u is rational, so that 0 |f (x)| dx = I+ + I− .
as desired. From the triangle inequality |a + b| ≥ ±(|a| − |b|), we
Second solution: This solution uses some basic Galois have the inequality
theory. We may assume r1 6= r2 , since otherwise they ZZ
are both rational and so then is r1 r2 . |f (x) + f (y)| dx dy
E+ ×E−
Let τ be an automorphism of the field of algebraic num- ZZ
bers; then τ maps each ri to another one, and fixes ≥± (|f (x)| − |f (y)|) dx dy
E+ ×E−
the rational number r1 + r2 . If τ (r1 ) equals one of
r1 or r2 , then τ (r2 ) must equal the other one, and vice = ±(µ− I+ − µ+ I− ),
versa. Thus τ either fixes the set {r1 , r2 } or moves it
and likewise with + and − switched. Adding these in-
to {r3 , r4 }. But if the latter happened, we would have
equalities together and allowing all possible choices of
r1 + r2 = r3 + r4 , contrary to hypothesis. Thus τ fixes
the signs, we get
the set {r1 , r2 } and in particular the number r1 r2 . Since ZZ
this is true for any τ , r1 r2 must be rational.
|f (x) + f (y)| dx dy
Note: The conclusion fails if we allow r1 +r2 = r3 +r4 . (E+ ×E− )∪(E− ×E+ )
For instance, take the polynomial x4 − 2 and √ label ≥ max {0, 2(µ− I+ − µ+ I− ), 2(µ+ I− − µ− I+ )} .
2
its roots so that (x − r1 )(x
√ − r 2 ) = x − 2 and
To this inequality, we add the equalities
(x − r3 )(x − r4 ) = x2 + 2. ZZ
B5 Place the unit circle on the complex plane so that |f (x) + f (y)| dx dy = 2µ+ I+
E+ ×E+
A, B, C correspond to the complex numbers 1, ω, ω 2 , ZZ
where ω = e2πi/3 , and let P correspond to the complex |f (x) + f (y)| dx dy = 2µ− I−
number x. The distances a, b, c are then |x − 1|, |x − E− ×E−
ω|, |x − ω 2 |. Now the identity Z 1
− |f (x)| dx = −(µ+ + µ− )(I+ + I− )
(x − 1) + ω(x − ω) + ω 2 (x − ω 2 ) = 0 0
to obtain
implies that there is a triangle whose sides, as vec- Z 1Z 1 Z 1
tors, correspond to the complex numbers x − 1, ω(x − |f (x) + f (y)| dx dy − |f (x)| dx
ω), ω 2 (x − ω 2 ); this triangle has sides of length a, b, c. 0 0 0
≥ max{(µ+ − µ− )(I+ + I− ) + 2µ− (I− − I+ ),
To calculate the area of this triangle, we first note a more
general formula. If a triangle in the plane has vertices (µ+ − µ− )(I+ − I− ),
at 0, v1 = s1 + it1 , v2 = s2 + it2 , then it is well (µ− − µ+ )(I+ + I− ) + 2µ+ (I+ − I− )}.
known that the area of the triangle is |s1 t2 − s2 t1 |/2 =
|v1 v2 − v2 v1 |/4. In our case, we have v1 = x − 1 and Now simply note that for each of the possible compar-
v2 = ω(x − ω); then isons between µ+ and µ− , and between I+ and I− , one
of the three terms above is manifestly nonnegative. This
√ yields the desired result.
v1 v2 − v2 v1 = (ω 2 − ω)(xx − 1) = i 3(|x|2 − 1).
Second solution: We will show at the end that it is
√
Hence the area of the triangle is 3(1 − |x|2 )/4, which enough to prove a discrete analogue: if x1 , . . . , xn are
depends only on the distance |x| from P to O. real numbers, then
n n
1 X 1X
B6 First solution: (composite of solutions by Feng Xie |xi + xj | ≥ |xi |.
and David Pritchard) Let µ denote Lebesgue measure n2 i,j=1 n i=1

www.adultpdf.com
In the meantime, we concentrate on this assertion. (x1 , . . . , xn ) runs over [0, 1]n yields
n(n − 1) 1 1
Z Z
Let f (x1 , . . . , xn ) denote the difference between the
two sides. We induct on the number of nonzero values |f (x) + f (y)| dy dx
2 0 0
of |xi |. We leave for later the base case, where there is
n(n − 2) 1
Z
at most one such value. Suppose instead for now that ≥ |f (x)| dx,
there are two or more. Let s be the smallest, and sup- 2 0
pose without loss of generality that x1 = · · · = xa = s, or
xa+1 = · · · = xa+b = −s, and for i > a + b, either Z 1Z 1
n−2 1
Z
xi = 0 or |xi | > s. (One of a, b might be zero.) |f (x) + f (y)| dy dx ≥ |f (x)| dx.
0 0 n−1 0
Now consider Taking the limit as n → ∞ now yields the desired re-
sult.
a terms b terms
z }| { z }| { Third solution: (by David Savitt) We give an argument
f (t, · · · , t, −t, · · · , −t, xa+b+1 , · · · , xn ) which yields the following improved result. Let µp and
µn be the measure of the sets {x : f (x) > 0} and
as a function of t. It is piecewise linear near s; in fact, {x : f (x) < 0} respectively, and let µ ≤ 1/2 be
it is linear between 0 and the smallest nonzero value min(µp , µn ). Then
among |xa+b+1 |, . . . , |xn | (which exists by hypothesis). Z 1Z 1
Thus its minimum is achieved by one (or both) of those |f (x) + f (y)| dx dy
two endpoints. In other words, we can reduce the num- 0 0
ber of distinct nonzero absolute values among the xi Z 1
2
without increasing f . This yields the induction, pend- ≥ (1 + (1 − 2µ) ) |f (x)| dx.
0
ing verification of the base case.
Note that the constant can be seen to be best possible
As for the base case, suppose that x1 = · · · = xa = by considering a sequence of functions tending towards
s > 0, xa+1 = · · · = xa+b = −s, and xa+b+1 = · · · = the step function which is 1 on [0, µ] and −1 on (µ, 1].
xn = 0. (Here one or even both of a, b could be zero, Suppose without loss of generality that µ = µp . As in
though the latter case is trivial.) Then the second solution, it suffices to prove a strengthened
s discrete analogue, namely
f (x1 , . . . , xn ) = (2a2 + 2b2 + (a + b)(n − a − b)) 2 ! n
!
n2

1 X 2p 1X
s |ai +aj | ≥ 1 + 1 − |ai | ,
− (a + b) n2 i,j n n i=1
n
s
= 2 (a2 − 2ab + b2 ) where p ≤ n/2 is the number of a1 , . . . , an which are
n positive. (We need only make sure to choose meshes so
≥ 0. that p/n → µ as n → ∞.) An equivalent inequality is
n
2p2 X

This proves the base case of the induction, completing X
|ai + aj | ≥ n − 1 − 2p + |ai |.
the solution of the discrete analogue. n
1≤i<j≤n i=1
To deduce the original statement from the discrete ana-
logue, approximate both integrals by equally-spaced Write ri = |ai |, and assume without loss of gener-
Riemann sums and take limits. This works because ality that ri ≥ ri+1 for each i. Then for i < j,
given a continuous function on a product of closed in- |ai + aj | = ri + rj if ai and aj have the same sign,
tervals, any sequence of Riemann sums with mesh size and is ri − rj if they have opposite signs. The left-hand
tending to zero converges to the integral. (The domain side is therefore equal to
is compact, so the function is uniformly continuous. n
X n
X
Hence for any > 0 there is a cutoff below which any (n − i)ri + rj Cj ,
mesh size forces the discrepancy between the Riemann i=1 j=1
sum and the integral to be less than .) where
Alternate derivation (based on a solution by Dan Bern- Cj = #{i < j : sgn(ai ) = sgn(aj )}
stein): from the discrete analogue, we have − #{i < j : sgn(ai ) 6= sgn(aj )}.
n Pk
X n−2X Consider the partial sum Pk = j=1 Cj . If exactly pk
|f (xi ) + f (xj )| ≥ |f (xi )|,
2 i=1 of a1 , . . . , ak are positive, then this sum is equal to
1≤i<j≤n

pk k − pk k pk k − pk
+ − − − ,
for all x1 , . . . , xn ∈ [0, 1]. Integrating both sides as 2 2 2 2 2

www.adultpdf.com
which expands and simplifies to It follows that
n n
k
X X X
−2pk (k − pk ) + . |ai + aj | = (n − i)ri + rj Cj
2 1≤i<j≤n i=1 j=1
2p
For k ≤ 2p even, this partial sum would be mini-
X
≥ (n − i − [i even])ri
mized with pk = k2 , and would then equal − k2 ; for i=1
k < 2p odd, this partial sum would be minimized with n
pk = k±1 k−1
2 , and would then equal − 2 . Either way,
X
+ (n − 1 − 2p)ri
k
Pk ≥ −b 2 c. On the other hand, if k > 2p, then i=2p+1
n
X
= (n − 1 − 2p) ri +

k k
−2pk (k − pk ) + ≥ −2p(k − p) + i=1
2 2
2p
X
since pk is at most p. Define Qk to be −b k2 c
if k ≤ 2p (2p + 1 − i − [i even])ri
i=1
and −2p(k − p) + k2 if k ≥ 2p, so that Pk ≥ Qk . Note

n 2p
that Q1 = 0. X X
≥ (n − 1 − 2p) ri + p ri
Partial summation gives i=1 i=1
n n
X 2p X
n n ≥ (n − 1 − 2p) ri + p ri ,
X X n i=1
rj Cj = rn Pn + (rj−1 − rj )Pj−1 i=1
j=1 j=2
n
as desired. The next-to-last and last inequalities each
≥ rn Qn +
X
(rj−1 − rj )Qj−1 follow from the monotonicity of the ri ’s, the former by
j=2
pairing the ith term with the (2p + 1 − i)th .
n
X Note: Compare the closely related Problem 6 from the
= rj (Qj − Qj−1 ) 2000 USA Mathematical Olympiad: prove that for any
j=2 nonnegative real numbers a1 , . . . , an , b1 , . . . , bn , one
= −r2 − r4 − · · · − r2p has
Xn n
X n
X
+ (j − 1 − 2p)rj . min{ai aj , bi bj } ≤ min{ai bj , aj bi }.
j=2p+1 i,j=1 i,j=1

www.adultpdf.com
A1 Yes. Suppose otherwise. Then there would be an N is acute), we have sin ∠P1 ≤ sin ∠P2 . By the Law of
such that S(N ) < 80% and S(N + 1) > 80%; that is, Sines,
O’Keal’s free throw percentage is under 80% at some 1 1
point, and after one subsequent free throw (necessarily A1 = b1 c1 sin ∠P1 ≤ b2 c2 sin ∠P2 = A2 .
2 2
made), her percentage is over 80%. If she makes m of
her first N free throws, then m/N < 4/5 and (m + Remark: Many other solutions are possible; for in-
1)/(N + 1) > 4/5. This means that 5m < 4n < stance, one uses Heron’s formula for the area of a tri-
5m + 1, which is impossible since then 4n is an integer angle in terms of its side lengths.
between the consecutive integers 5m and 5m + 1.
A3 Define a sequence vn by vn = (n − 1)(n − 3) · · · (4)(2)
Remark: This same argument works for any fraction if n is odd and vn = (n − 1)(n − 3) · · · (3)(1) if n is
of the form (n − 1)/n for some integer n > 1, but not even; it suffices to prove that un = vn for all n ≥ 2.
for any other real number between 0 and 1. Now vn+3 vn = (n + 2)(n)(n − 1)! and vn+2 vn+1 =
A2 First solution: (partly due to Ravi Vakil) Yes, it does (n + 1)!, and so vn+3 vn − vn+2 vn+1 = n!. Since we
follow. For i = 1, 2, let Pi , Qi , Ri be the vertices of Ti can check that un = vn for n = 2, 3, 4, and un and vn
opposide the sides of length ai , bi , ci , respectively. satisfy the same recurrence, it follows by induction that
un = vn for all n ≥ 2, as desired.
We first check the case where a1 = a2 (or b1 = b2 or
c1 = c2 , by the same argument after relabeling). Imag- A4 It suffices to verify that
ine T2 as being drawn with the base Q2 R2 horizontal x1 · · · xn
and the point P2 above the line Q2 R2 . We may then
position T1 so that Q1 = Q2 , R1 = R2 , and P1 lies 1 X
= n (e1 · · · en )(e1 x1 + · · · + en xn )n .
above the line Q1 R1 = Q2 R2 . Then P1 also lies inside 2 n!
ei ∈{−1,1}
the region bounded by the circles through P2 centered
at Q2 and R2 . Since ∠Q2 and ∠R2 are acute, the part To check this, first note that the right side vanishes iden-
of this region above the line Q2 R2 lies within T2 . In tically for x1 = 0, because each term cancels the corre-
particular, the distance from P1 to the line Q2 R2 is less sponding term with e1 flipped. Hence the right side, as
than or equal to the distance from P2 to the line Q2 R2 ; a polynomial, is divisible by x1 ; similarly it is divisible
hence A1 ≤ A2 . by x2 , . . . , xn . Thus the right side is equal to x1 · · · xn
times a scalar. (Another way to see this: the right side is
To deduce the general case, put
clearly odd as a polynomial in each individual variable,
r = max{a1 /a2 , b1 /b2 , c1 /c2 }. but the only degree n monomial in x1 , . . . , xn with that
property is x1 · · · xn .) Since each summand contributes
1
Let T3 be the triangle with sides ra2 , rb2 , rc2 , which 2n x1 · · · xn to the sum, the scalar factor is 1 and we are
has area r2 A2 . Applying the special case to T1 and T3 , done.
we deduce that A1 ≤ r2 A2 ; since r ≤ 1 by hypothesis, Remark: Several variants on the above construction are
we have A1 ≤ A2 as desired. possible; for instance,
Remark: Another geometric argument in the case a1 = x1 · · · xn
a2 is that since angles ∠Q2 and ∠R2 are acute, the per-
1 X
pendicular to Q2 R2 through P2 separates Q2 from R2 . = (−1)n−e1 −···−en (e1 x1 + · · · + en xn )n
If A1 > A2 , then P1 lies above the parallel to Q2 R2 n!
ei ∈{0,1}
through P2 ; if then it lies on or to the left of the vertical
line through P2 , we have c1 > c2 because the inequality by the same argument as above.
holds for both horizontal and vertical components (pos- Remark: These construction work over any field of
sibly with equality for one, but not both). Similarly, if characteristic greater than n (at least for n > 1). On the
P1 lies to the right of the vertical, then b1 > b2 . other hand, no construction is possible over a field of
Second solution: (attribution unknown) Retain nota- characteristic p ≤ n, since the coefficient of x1 · · · xn
tion as in the first paragraph of the first solution. Since in the expansion of (e1 x1 + · · · + en xn )n is zero for any
the angle measures in any triangle add up to π, some ei .
angle of T1 must have measure less than or equal to its Remark: Richard Stanley asks whether one can use
counterpart in T2 . Without loss of generality assume fewer than 2n terms, and what the smallest possible
that ∠P1 ≤ ∠P2 . Since the latter is acute (because T2 number is.

www.adultpdf.com
2
A5 First solution: First recall that any graph with n ver- – With probability 1/4, the i-th square is opposite in
tices and e edges has at least n − e connected com- color from the adjacent squares directly above and
ponents (add each edge one at a time, and note that to the left of it. In this case adding the i-th square
it reduces the number of components by at most 1). adds one component.
Now imagine the squares of the checkerboard as a
– With probability 1/8, the i-th square is the same
graph, whose vertices are connected if the correspond-
in color as the adjacent squares directly above and
ing squares share a side and are the same color. Let A
to the left of it, but opposite in color from its diag-
be the number of edges in the graph, and let B be the
onal neighbor above and to the left. In this case,
number of 4-cycles (formed by monochromatic 2 × 2
adding the i-th square either removes a component
squares). If we remove the bottom edge of each 4-cycle,
or leaves the number unchanged.
the resulting graph has the same number of connected
components as the original one; hence this number is at – In all other cases, the number of components re-
least mains unchanged upon adding the i-th square.
mn − A + B. Hence adding the i-th square increases the expected

number of components by 1/4 − 1/8 = 1/8.
By the linearity of expectation, the expected number of
If the i-th square does abut the left edge of the board,
connected components is at least
the situation is even simpler: if the i-th square differs in
mn − E(A) + E(B). color from the square above it, one component is added,
otherwise the number does not change. Hence adding
Moreover, we may compute E(A) by summing over the i-th square increases the expected number of com-
the individual pairs of adjacent squares, and we may ponents by 1/2; likewise if the i-th square abuts the top
compute E(B) by summing over the individual 2 × 2 edge of the board. Thus the expected number of com-
squares. Thus ponents is at least i/8 by induction, as desired.
Remark: Some solvers attempted to consider adding
1 one row at a time, rather than one square; this must be
E(A) = (m(n − 1) + (m − 1)n),
2 handled with great care, as it is possible that the num-
1 ber of components can drop rather precipitously upon
E(B) = (m − 1)(n − 1),
8 adding an entire row.
and so the expected number of components is at least A6 By approximating each integral with a Riemann sum,
1 1 we may reduce to proving the discrete analogue: for
mn − (m(n − 1) + (m − 1)n) + (m − 1)(n − 1) xij ∈ R for i, j = 1, . . . , n,
2 8
mn + 3m + 3n + 1 mn 2
= > .
 !2
n n n n
8 8 X X X X
n  xij  +n xij
i=1 j=1 j=1 i=1
Remark: A “dual” approach is to consider the graph
2
whose vertices are the corners of the squares of the

n X
X n n X
X n
checkerboard, with two vertices joined if they are ad- ≤ xij  + n2 x2ij .
jacent and the edge between then does not separate two i=1 j=1 i=1 j=1
squares of the same color. In this approach, the 4-cycles
become isolated vertices, and the bound on components The difference between the right side and the left side
is replaced by a call to Euler’s formula relating the ver- is
tices, edges and faces of a planar figure. (One must be
careful, however, to correctly handle faces which are n
1 X
not simply connected.) (xij + xkl − xil − xkj )2 ,
4
i,j,k,l=1
Second solution: (by Noam Elkies) Number the
squares of the checkerboard 1, . . . , mn by numbering which is evidently nonnegative. If you prefer not to dis-
the first row from left to right, then the second row, cretize, you may rewrite the original inequality as
and so on. We prove by induction on i that if we just
consider the figure formed by the first i squares, its Z 1 Z 1 Z 1 Z 1
expected number of monochromatic components is at F (x, y, z, w)2 dx dy dz dw ≥ 0
least i/8. For i = 1, this is clear. 0 0 0 0
Suppose the i-th square does not abut the left edge or for
the top row of the board. Then we may divide into three
cases. F (x, y, z, w) = f (x, y) + f (z, w) − f (x, w) − f (z, y).

www.adultpdf.com
3
Remark: (by Po-Ning Chen) The discrete inequality (m + n)!/(m + n)m+n . On the other hand, if p is the
can be arrived at more systematically by repeatedly ap- probability of picking exactly m red balls, then p < 1
plying the following identity: for any real a1 , . . . , an , and the probability of picking each ball exactly once is
!2 p(mm /m!)(nn /n!).
n n
X X X Second solution: (by David Savitt) Define
(xi − xj )2 = n x2i − xi .
1≤i<j≤n i=1 i=1
Sk = {i/k : i = 1, . . . , k}
Remark: (by David Savitt) The discrete inequality can and rewrite the desired inequality as
also be interpreted as follows. For c, d ∈ {1, . . . , n−1}
and ζn = e2πi/n , put
Y Y Y
x y> z.
X x∈Sm y∈Sn z∈Sm+n
zc,d = ζnci+dj xij .
i,j To prove this, it suffices to check that if we sort the
multiplicands on both sides into increasing order, the i-
Then the given inequality is equivalent to th term on the left side is greater than or equal to the i-th
n−1 term on the right side. (The equality is strict already for
i = 1, so you do get a strict inequality above.)
X
|zc,d |2 ≥ 0.
c,d=1 Another way to say this is that for any i, the number of
factors on the left side which are less than i/(m + n) is
B1 Let k be an integer, 0 ≤ k ≤ n−1. Since P (r)/rk = 0, less than i. But since j/m < i/(m + n) is equivalent
we have to j < im/(m + n), that number is

cn rn−k + cn−1 rn−k+1 + · · · + ck+1 r im in
−1+ −1
= −(ck + ck−1 r−1 + · · · + c0 r−k ). m+n m+n
im in
≤ + − 1 = i − 1.
Write r = p/q where p and q are relatively prime. Then m+n m+n
the left hand side of the above equation can be written as
a fraction with denominator q n−k , while the right hand Third solution: Put f (x) = x(log(x+1)−log x); then
side is a fraction with denominator pk . Since p and q for x > 0,
are relatively prime, both sides of the equation must be
an integer, and the result follows. 1
f 0 (x) = log(1 + 1/x) −
Remark: If we write r = a/b in lowest terms, then x+1
P (x) factors as (bx − a)Q(x), where the polynomial 1
f 00 (x) = − .
Q has integer coefficients because you can either do the x(x + 1)2
long division from the left and get denominators divis-
ible only by primes dividing b, or do it from the right Hence f 00 (x) < 0 for all x; since f 0 (x) → 0 as x → ∞,
and get denominators divisible only by primes dividing we have f 0 (x) > 0 for x > 0, so f is strictly increasing.
a. The numbers given in the problem are none other Put g(m) = m log m − log(m!); then g(m + 1) −
than a times the coefficients of Q. More generally, if g(m) = f (m), so g(m + 1) − g(m) increases with
P (x) is divisible, as a polynomial over the rationals, by m. By induction, g(m + n) − g(m) increases with n
a polynomial R(x) with integer coefficients, then P/R for any positive integer n, so in particular
also has integer coefficients; this is known as “Gauss’s
lemma” and holds in any unique factorization domain. g(m + n) − g(m) > g(n) − g(1) + f (m)
≥ g(n)
B2 First solution: We have

m+n
since g(1) = 0. Exponentiating yields the desired in-
m+n
(m + n) > mm n n equality.
m
B3 The answer is {a | a > 2}. If a > 2, then the func-
because the binomial expansion of (m + n)m+n in- tion f (x) = 2a/(a − 2) has the desired property; both
cludes the term on the right as well as some others. Re- perimeter and area of R in this case are 2a2 /(a − 2).
arranging this inequality yields the claim. Now suppose that a ≤ 2, and let f (x) be a nonnegative
Remark: One can also interpret this argument com- continuous function on [0, a]. Let P = (x0 , y0 ) be a
binatorially. Suppose that we choose m + n times point on the graph of f (x) with maximal y-coordinate;
(with replacement) uniformly randomly from a set of then the area of R is at most ay0 since it lies below the
m + n balls, of which m are red and n are blue. Then line y = y0 . On the other hand, the points (0, 0), (a, 0),
the probability of picking each ball exactly once is and P divide the boundary of R into three sections. The

www.adultpdf.com
4
length of the section between (0, 0) and P is at least the since limN →∞ (xN ln(1 + xN +1 )) = 0 for 0 < x < 1,
distance between (0, 0) and P , which is at least y0 ; the we conclude that L = − ln 2 + limx→1− f (x), where
length of the section between P and (a, 0) is similarly ∞
at least y0 ; and the length of the section between (0, 0)
X
f (x) = (1/x − 1) xn ln(1 + xn )
and (a, 0) is a. Since a ≤ 2, we have 2y0 + a > ay0 n=1
and hence the perimeter of R is strictly greater than the X∞ X∞
area of R. = (1/x − 1) (−1)m+1 xn+mn /m.
n=1 m=1
B4 First solution: Identify the xy-plane with the complex
plane C, so that Pk is the real number k. If z is sent to This final double sum converges absolutely when 0 <
z 0 by a counterclockwise rotation by θ about Pk , then x < 1, since
z 0 − k = eiθ (z − k); hence the rotation Rk sends z to ∞ X
∞ ∞
ζz + k(1 − ζ), where ζ = e2πi/n . It follows that R1
X X
xn+mn /m = xn (− ln(1 − xn ))
followed by R2 sends z to ζ(ζz + (1 − ζ)) + 2(1 − ζ) = n=1 m=1 n=1
ζ 2 z + (1 − ζ)(ζ + 2), and so forth; an easy induction X∞
shows that R sends z to < xn (− ln(1 − x)),
n=1
ζ n z + (1 − ζ)(ζ n−1 + 2ζ n−2 + · · · + (n − 1)ζ + n).
which converges. (Note that − ln(1 − x) and − ln(1 −
Expanding the product (1 − ζ)(ζ n−1 + 2ζ n−2 + · · · + xn ) are positive.) Hence we may interchange the sum-
(n − 1)ζ + n) yields −ζ n − ζ n−1 − · · · − ζ + n = mations in f (x) to obtain
n. Thus R sends z to z + n; in cartesian coordinates, ∞ X ∞
R(x, y) = (x + n, y).
X (−1)m+1 x(m+1)n
f (x) = (1/x − 1)
m
Second solution: (by Andy Lutomirski, via Ravi Vakil) m=1 n=1
∞
Imagine a regular n-gon of side length 1 placed with its (−1)m+1 xm (1 − x)
X
top edge on the x-axis and the left endpoint of that edge = (1/x − 1) .
m=1
m 1 − xm+1
at the origin. Then the rotations correspond to rolling
this n-gon along the x-axis; after the n rotations, it This last sum converges absolutely uniformly in x, so
clearly ends up in its original rotation and translated n it is legitimate to take limits term by term. Since
units to the right. Hence the whole plane must do so as xm 1−x 1
limx→1− 1−x m+1 = m+1 for fixed m, we have
well.
∞
Third solution: (attribution unknown) Viewing each
X (−1)m+1
lim f (x) =
Rk as a function of a complex number z as in the first x→1−
m=1
m(m + 1)
solution, the function Rn ◦ Rn−1 ◦ · · · ◦ R1 (z) is linear ∞
1 1
in z with slope ζ n = 1. It thus equals z + T for some
X
m+1
= (−1) −
T ∈ C. Since f1 (1) = 1, we can write 1 + T = Rn ◦ m=1
m m+1
· · · ◦ R2 (1). However, we also have ∞
!
X (−1)m+1
=2 −1
Rn ◦ · · · ◦ R2 (1) = Rn−1 ◦ R1 (0) + 1 m=1
m
by the symmetry in how the Ri are defined. Hence = 2 ln 2 − 1,

and hence L = ln 2 − 1 and the desired limit is 2/e.
Rn (1 + T ) = Rn ◦ R1 (0) + Rn (1) = T + Rn (1);
Remark: Note that the last series is not absolutely con-
that is, Rn (T ) = T . Hence T = n, as desired. vergent, so the recombination must be done without re-
arranging terms.
B5 First solution: By taking logarithms, we see
Second solution: (by Greg Price, via Tony Zhang and
desired limit is exp(L), where L
that the P =
∞ Anders Kaseorg) Put tn (x) = ln(1 + xn ); we can then
limx→1− n=0 xn ln(1 + xn+1 ) − ln(1 + xn ) .
write xn = exp(tn (x)) − 1, and
Now
∞
N
X
X L = lim− (tn (x) − tn+1 (x))(1 − exp(tn (x))).
xn ln(1 + xn+1 ) − ln(1 + xn )

x→1
n=0
n=0
N N The expression on the right is a Riemann sum approxi-
R ln 2
mating the integral 0 (1−et ) dt, over the subdivision
X X
n+1 n+1 n n
= 1/x x ln(1 + x )− x ln(1 + x )
n=0 n=0 of [0, ln(2)) given by the tn (x). As x → 1− , the max-
N
X imum difference between consecutive tn (x) tends to 0,
= xN ln(1 + xN +1 ) − ln 2 + (1/x − 1) xn ln(1 + xn ); so the Riemann sum tends to the value of the integral.
R ln 2
n=1 Hence L = 0 (1 − et ) dt = ln 2 − 1, as desired.

www.adultpdf.com
5
B6 First solution: (based on a solution of Dan Bernstein) of (b) with n replaced by n + 1 holds for en+1 6= 0; of
Note that for any b, the condition that b ∈ / B already course it holds for en+1 = 0 because (b) was already
forces lim sup N (x)/x to be at most 1/2: pair off 2mb+ known. Since the analogue of (a) holds by construction,
n with (2m + 1)b + n for n = 1, . . . , b, and note that we have completed this step of the construction and the
at most one member of each pair may belong to A. The recursion may continue.
idea of the proof is to do something similar with pairs Since we can construct b0 , . . . , bn satisfying (a) and (b)
replaced by larger clumps, using long runs of excluded for any n, we have lim sup N (x)/x ≤ 1/2n for any n,
elements of B. yielding lim N (x)/x = 0 as desired.
Suppose we have positive integers b0 = 1, b1 , . . . , bn
Second solution: (by Paul Pollack) Let S be the set
with the following properties:
of possible values of lim sup N (x)/x; since S ⊆ [0, 1]
(a) For i = 1, . . . , n, ci = bi /(2bi−1 ) is an integer. is bounded, it has a least upper bound L. Suppose by
way of contradiction that L > 0; we can then choose
(b) For ei ∈ {−1, 0, 1}, |e1 b1 + · · · + en bn | ∈
/ B.
A, B satisfying the conditions of the problem such that
Each nonnegative integer a has a unique “base expan- lim sup N (x)/x > 3L/4.
sion” To begin with, we can certainly find some positive inte-
ger m ∈ / B, so that A is disjoint from A+m = {a+m :
a = a0 b0 + · · · + an−1 bn−1 + mbn (0 ≤ ai < 2ci ); a ∈ A}. Put A0 = A∪(A+m) and let N 0 (x) be the size
of A0 ∩{1, . . . , x}; then lim sup N 0 (x)/x = 3L/2 > L,
if two integers have expansions with the same value
so A0 cannot obey the conditions of the problem state-
of m, and values of ai differing by at most 1 for
ment. That is, if we let B 0 be the set of positive integers
i = 0, . . . , n − 1, then their difference is not in B, so
that occur as differences between elements of A0 , then
at most one of them lies in A. In particular, for any
there exists an integer n such that among any n consec-
di ∈ {0, . . . , ci − 1}, any m0 ∈ {0, 2c0 − 1} and any
utive integers, at least one lies in B 0 . But
mn , the set
B 0 ⊆ {b + em : b ∈ B, e ∈ {−1, 0, 1}},
{m0 b0 + (2d1 + e1 )b0 + · · ·
+ (2dn−1 + en−1 )bn−1 + (2mn + en )bn }, so among any n + 2m consecutive integers, at least one
lies in B. This contradicts the condition of the problem
where each ei runs over {0, 1}, contains at most one statement.
element of A; consequently, lim sup N (x)/x ≤ 1/2n .
We conclude that it is impossible to have L > 0, so
We now produce such bi recursively, starting with b0 = L = 0 and lim N (x)/x = 0 as desired.
1 (and both (a) and (b) holding vacuously). Given
b0 , . . . , bn satisfying (a) and (b), note that b0 + · · · + Remark: A hybrid between these two arguments is
bn−1 < bn by induction on n. By the hypotheses to note that if we can produce c1 , . . . , cn such that
of the problem, we can find a set Sn of 6bn consec- |ci − cj | ∈ / B for i, j = 1, . . . , n, then the translates A +
utive integers, none of which belongs to B. Let bn+1 c1 , . . . , A + cn are disjoint and so lim sup N (x)/x ≤
be the second-smallest multiple of 2bn in Sn ; then 1/n. Given c1 ≤ · · · ≤ cn as above, we can then choose
bn+1 + x ∈ Sn for −2bn ≤ x ≤ 0 clearly, and also cn+1 to be the largest element of a run of cn + 1 con-
for 0 ≤ x ≤ 2bn because there are most 4bn − 1 ele- secutive integers, none of which lie in B.
ments of Sn preceding bn+1 . In particular, the analogue

www.adultpdf.com
A1 We proceed by induction, with base case 1 = 20 30 . segment joining (n − 1, 3) to (n − 1, 2) results in a path

Suppose all integers less than n − 1 can be represented. in An−1 . (This construction is reversible, lengthening
If n is even, then we can take a representation of n/2 any path in An−1 to a path in An .) In the latter case, P
and multiply each term by 2 to obtain a representation contains the subpath P20 which joins (n − 1, 3), (n, 3),
of n. If n is odd, put m = blog3 nc, so that 3m ≤ n < (n, 2), (n, 1) consecutively; deleting P20 results in a path
3m+1 . If 3m = n, we are done. Otherwise, choose a in Bn−1 , and this construction is also reversible. The
representation (n−3m )/2 = s1 +· · ·+sk in the desired desired bijection follows.
form. Then Similarly, there is a bijection between Bn and An−1 ∪
m Bn−1 for n ≥ 2. It follows by induction that for n ≥ 2,
n = 3 + 2s1 + · · · + 2sk ,
|An | = |Bn | = 2n−2 (|A1 | + |B1 |). But |A1 | = 0 and
and clearly none of the 2si divide each other or 3m . |B1 | = 1, and hence the desired answer is |An | = 2n−2 .
Moreover, since 2si ≤ n − 3m < 3m+1 − 3m , we Remarks: Other bijective arguments are possible: for
have si < 3m , so 3m cannot divide 2si either. Thus instance, Noam Elkies points out that each element
n has a representation of the desired form in all cases, of An ∪ Bn contains a different one of the possi-
completing the induction. ble sets of segments of the form (i, 2), (i + 1, 2) for
Remarks: This problem is originally due to Paul Erdős. i = 1, . . . , n − 1. Richard Stanley provides the refer-
Note that the representations need not be unique: for ence: K.L. Collins and L.B. Krompart, The number of
instance, Hamiltonian paths in a rectangular grid, Discrete Math.
169 (1997), 29–38. This problem is Theorem 1 of that
11 = 2 + 9 = 3 + 8. paper; the cases of 4 × n and 5 × n grids are also
treated. The paper can also be found online at the URL
kcollins.web.wesleyan.edu/vita.htm.
A2 We will assume n ≥ 2 hereafter, since the answer is 0
for n = 1. A3 Note that it is implicit in the problem that p is noncon-
First solution: We show that the set of rook tours from stant, one may take any branch of the square root, and
(1, 1) to (n, 1) is in bijection with the set of subsets of that z = 0 should be ignored.
{1, 2, ..., n} that include n and contain an even number Qn
First solution: Write p(z) = c j=1 (z − rj ), so that
of elements in total. Since the latter set evidently con-
tains 2n−2 elements, so does the former. n
g 0 (z) 1 X z + rj
We now construct the bijection. Given a rook tour P = .
g(z) 2z j=1 z − rj
from (1, 1) to (n, 1), let S = S(P ) denote the set of
all i ∈ {1, 2, . . . , n} for which there is either a directed
edge from (i, 1) to (i, 2) or from (i, 3) to (i, 2). It is Now if z 6= rj for all j,then
clear that this set S includes n and must contain an
even number of elements. Conversely, given a subset z + rj (z + rj )(z − rj ) |z|2 − 1 + 2Im(zrj )
= = ,
S = {a1 , a2 , . . . , a2r = n} ⊂ {1, 2, . . . , n} of this z − rj |z − rj |2 |z − rj |2
type with a1 < a2 < · · · < a2r , we notice that there is
a unique path P containing (ai , 2 + (−1)i ), (a1 , 2) for and so
i = 1, 2, . . . , 2r. This establishes the desired bijection.  
Second solution: Let An denote the set of rook tours zg 0 (z) |z|2 − 1 X 1
Re = .
beginning at (1, 1) and ending at (n, 1), and let Bn de- g(z) 2 j
|z − rj |2
note the set of rook tours beginning at (1, 1) and ending
at (n, 3). Since the quantity in parentheses is positive, g 0 (z)/g(z)
For n ≥ 2, we construct a bijection between An and can be 0 only if |z| = 1. If on the other hand z = rj for
An−1 ∪Bn−1 . Any path P in An contains either the line some j, then |z| = 1 anyway.
segment P1 between (n − 1, 1) and (n, 1), or the line Qn
Second solution: Write p(z) = c j=1 (z −rj ), so that
segment P2 between (n, 2) and (n, 1). In the former
case, P must also contain the subpath P10 which joins n
g 0 (z) X

1 1
(n − 1, 3), (n, 3), (n, 2), and (n − 1, 2) consecutively; = − .
then deleting P1 and P10 from P and adding the line g(z) j=1
z − rj 2z

www.adultpdf.com
2
We first check that g 0 (z) 6= 0 whenever z is real and On the other hand, the term on the left is the dot product
z > 1. In this case, for rj = eiθj , we have z − rj = of r1 +· · ·+ra with itself, i.e., its squared length. Since
1 1
(z − cos(θj )) + sin(θj )i, so the real part of z−r j
− 2z this vector has a in each of its first b coordinates, the
is dot product is at least a2 b. Hence an ≥ a2 b, whence
n ≥ ab as desired.
z − cos(θj ) 1
− Second solution: (by Richard Stanley) Suppose with-
z 2 − 2z cos(θj ) + 1 2z out loss of generality that the a × b submatrix occupies
z2 − 1 the first a rows and the first b columns. Let M be the
= > 0. submatrix occupying the first a rows and the last n − b
2z(z 2 − 2z cos(θj ) + 1)
columns. Then the hypothesis implies that the matrix
Hence g 0 (z)/g(z) has positive real part, so g 0 (z)/g(z) M M T has n − b’s on the main diagonal and −b’s else-
and hence g(z) are nonzero. where. Hence the column vector v of length a consist-
ing of all 1’s satisfies M M T v = (n − ab)v, so n − ab is
Applying the same argument after replacing p(z) by an eigenvalue of M M T . But M M T is semidefinite, so
p(eiθ z), we deduce that g 0 cannot have any roots out- its eigenvalues are all nonnegative real numbers. Hence
side the unit circle. Applying the same argument after n − ab ≥ 0.
replacing p(z) by z n p(1/z), we also deduce that g 0 can-
not have any roots inside the unit circle. Hence all roots Remarks: A matrix as in the problem is called
of g 0 have absolute value 1, as desired. a Hadamard matrix, because it meets the equality
Qn condition of Hadamard’s inequality: any n × n matrix
Third solution: Write p(z) = c j=1 (z − rj ) and put with ±1 entries has absolute determinant at most nn/2 ,
rj = e2iθj . Note that g(e2iθ ) is equal to a nonzero with equality if and only if the rows are mutually
constant times orthogonal (from the interpretation of the determinant
n as the volume of a paralellepiped whose edges are
Y ei(θ+θj ) − e−i(θ+θj ) parallel to the row vectors). Note that this implies
h(θ) =
j=1
2i that the columns are also mutually orthogonal. A
n generalization of this problem, with a similar proof,
is known as Lindsey’s lemma: the sum of the entries
Y
= sin(θ + θj ).
j=1
in any√a × b submatrix of a Hadamard matrix is at
most abn. Stanley notes that Ryser (1981) asked
Since h has at least 2n roots (counting multiplicity) in for the smallest size of a Hadamard matrix containing
the interval [0, 2π), h0 does also by repeated applica- an r × s submatrix of all 1’s, and refers to the URL
tion of Rolle’s theorem. Since g 0 (e2iθ ) = 2ie2iθ h0 (θ), www3.interscience.wiley.com/cgi-bin/
g 0 (z 2 ) has at least 2n roots on the unit circle. Since abstract/110550861/ABSTRACT for more
g 0 (z 2 ) is equal to z −n−1 times a polynomial of degree information.
2n, g 0 (z 2 ) has all roots on the unit circle, as then does A5 First solution: We make the substitution x = tan θ,
g 0 (z). rewriting the desired integral as
Remarks: The second solution imitates the proof of Z π/4
the Gauss-Lucas theorem: the roots of the derivative of log(tan(θ) + 1) dθ.
a complex polynomial lie in the convex hull of the roots 0
of the original polynomial. The second solution is close
to problem B3 from the 2000 Putnam. A hybrid be- Write
tween the first and third solutions is to check that on the log(tan(θ) + 1)
unit circle, Re(zg 0 (z)/g(z)) = 0 while between any
two roots of p, Im(zg 0 (z)/g(z)) runs from +∞ to −∞ = log(sin(θ) + cos(θ)) − log(cos(θ))
and so must have a zero crossing. (This only works √
when p has distinct roots, but the general case follows and then note that sin(θ) + cos(θ) = 2 cos(π/4 − θ).
by the continuity of the roots of a polynomial as func- We may thus rewrite the integrand as
tions of the coefficients.) One can also construct a solu- 1
tion using Rouché’s theorem. log(2) + log(cos(π/4 − θ)) − log(cos(θ)).
2
A4 First solution: Choose a set of a rows r1 , . . . , ra con- But over the interval [0, π/4], the integrals of
taining an a × b submatrix whose entries are all 1. Then log(cos(θ)) and log(cos(π/4 − θ)) are equal, so their
for i, j ∈ {1, . . . , a}, we have ri · rj = n if i = j and 0 contributions cancel out. The desired integral is then
otherwise. Hence just the integral of 12 log(2) over the interval [0, π/4],
a
which is π log(2)/8.
X
ri · rj = an. Second solution: (by Roger Nelsen) Let I denote the
i,j=1 desired integral. We make the substitution x = (1 −

www.adultpdf.com
3
u)/(1 + u) to obtain is an alternating series whose terms strictly decrease to

Z 1 zero, so it converges. Moreover, its partial sums alter-
(1 + u)2 log(2/(1 + u)) 2 du nately bound the previous integral above and below, so
I=
0 2(1 + u2 ) (1 + u)2 the sum of the series coincides with the integral.
Z 1
log(2) − log(1 + u) Put
= du
0 1 + u2 1
xn dx
Z
Z 1 Jn = ;
du x2 + 1
= log(2) − I, 0
0 1 + u2
then J0 = arctan(1) = π4 and J1 = 12 log(2). More-
yielding
over,
Z 1
1 du π log(2) Z 1
I= log(2) = . 1
2 0 1 + u2 8 Jn + Jn+2 = xn dx = .
0 n+1
Third solution: (attributed to Steven Sivek) Define the Write
function
m
Z 1 X (−1)i−1
log(xt + 1) Am =
f (t) = dx 2i − 1
0 x2 + 1 i=1
m
X (−1)i−1
so that f (0) = 0 and the desired integral is f (1). Then Bm = ;
by differentiation under the integral, i=1
2i
Z 1
x then
f 0 (t) = 2
dx.
0 (xt + 1)(x + 1)
J2n = (−1)n (J0 − An )
By partial fractions, we obtain J2n+1 = (−1)n (J1 − Bn ).
x=1
0 2t arctan(x) − 2 log(tx + 1) + log(x2 + 1) Now the 2N -th partial sum of our series equals
f (t) =
2(t2 + 1)
x=0
N
πt + 2 log(2) − 4 log(t + 1) X J2n−1 J2n
= , −
4(t2 + 1) n=1
2n − 1 2n
N
whence X (−1)n−1 (−1)n
= (J1 − Bn−1 ) − (J0 − An )
log(2) arctan(t) π log(t2 + 1)
Z t
log(t + 1) n=1
2n − 1 2n
f (t) = + − dt
2 8 0 t2 + 1 = AN (J1 − BN −1 ) + BN (J0 − AN ) + AN BN .
and hence As N → ∞, AN → J0 and BN → J1 , so the sum
π log(2)
Z 1
log(t + 1) tends to J0 J1 = π log(2)/8.
f (1) = − dt.
4 0 t2 + 1 Remarks: The first two solutions are related by the fact
that if x = tan(θ), then 1 − x/(1 + x) = tan(π/4 − θ).
But the integral on the right is again the desired integral The strategy of the third solution (introducing a parame-
f (1), so we may move it to the left to obtain ter then differentiating it) was a favorite of physics No-
belist (and Putnam Fellow) Richard Feynman. Noam
π log(2)
2f (1) = Elkies notes that this integral is number 2.491#8 in
4 Gradshteyn and Ryzhik, Table of integrals, series, and
and hence f (1) = π log(2)/8 as desired. products. The Mathematica computer algebra system
Fourth solution: (by David Rusin) We have (version 5.2) successfully computes this integral, but we
do not know how.
∞
Z 1 Z 1 X !
log(x + 1) (−1)n−1 xn A6 First solution: The angle at a vertex P is acute if and
dx = dx.
0 x2 + 1 0 n=1
n(x2 + 1) only if all of the other points lie on an open semicir-
cle. We first deduce from this that if there are any
We next justify moving the sum through the integral two acute angles at all, they must occur consecutively.
sign. Note that Suppose the contrary; label the vertices Q1 , . . . , Qn in
∞ Z 1 counterclockwise order (starting anywhere), and sup-
X (−1)n−1 xn dx pose that the angles at Q1 and Qi are acute for some
n=1 0
n(x2 + 1) i with 3 ≤ i ≤ n − 1. Then the open semicircle starting

www.adultpdf.com
4
at Q2 and proceeding counterclockwise must contain If n = 1, we must have k1 = 1, which works. Note that
all of Q3 , . . . , Qn , while the open semicircle starting hereafter we cannot have k1 = 1.
at Qi and proceeding counterclockwise must contain If n = 2, we have (k1 , k2 ) ∈ {(2, 4), (3, 3)}, neither of
Qi+1 , . . . , Qn , Q1 , . . . , Qi−1 . Thus two open semicir- which work.
cles cover the entire circle, contradiction.
If n = 3, we have k1 + k2 + k3 = 11,
It follows that if the polygon has at least one acute an- so 2 ≤ k1 ≤ 3. Hence (k1 , k2 , k3 ) ∈
gle, then it has either one acute angle or two acute an- {(2, 2, 7), (2, 3, 6), (2, 4, 5), (3, 3, 5), (3, 4, 4)}, and
gles occurring consecutively. In particular, there is a only (2, 3, 6) works.
unique pair of consecutive vertices Q1 , Q2 in counter-
clockwise order for which ∠Q2 is acute and ∠Q1 is not If n = 4, we must have equality in the AM-HM inequal-
acute. Then the remaining points all lie in the arc from ity, which only happens when k1 = k2 = k3 = k4 = 4.
the antipode of Q1 to Q1 , but Q2 cannot lie in the arc, Hence the solutions are n = 1 and k1 = 1, n = 3 and
and the remaining points cannot all lie in the arc from (k1 , k2 , k3 ) is a permutation of (2, 3, 6), and n = 4 and
the antipode of Q1 to the antipode of Q2 . Given the (k1 , k2 , k3 , k4 ) = (4, 4, 4, 4).
choice of Q1 , Q2 , let x be the measure of the counter- Remark: In the cases n = 2, 3, Greg Kuperberg sug-
clockwise arc from Q1 to Q2 ; then the probability that gests the alternate approach of enumerating the solu-
the other points fall into position is 2−n+2 − xn−2 if tions of 1/k1 +· · ·+1/kn = 1 with k1 ≤ · · · ≤ kn . This
x ≤ 1/2 and 0 otherwise. is easily done by proceeding in lexicographic order: one
Hence the probability that the polygon has at least one obtains (2, 2) for n = 2, and (2, 3, 6), (2, 4, 4), (3, 3, 3)
acute angle with a given choice of which two points will for n = 3, and only (2, 3, 6) contributes to the final an-
act as Q1 and Q2 is swer.
Z 1/2
n − 2 −n+1 B3 First solution: The functions are precisely f (x) = cxd
(2−n+2 − xn−2 ) dx = 2 . for c, d > 0 arbitrary except that we must take c = 1
0 n−1
in case d = 1. To see that these work, note that
Since there are n(n − 1) choices for which two points f 0 (a/x) = dc(a/x)d−1 and x/f (x) = 1/(cxd−1 ), so
act as Q1 and Q2 , the probability of at least one acute the given equation holds if and only if dc2 ad−1 = 1.
angle is n(n − 2)2−n+1 . If d 6= 1, we may solve for a no matter what c is; if
d = 1, we must have c = 1. (Thanks to Brad Rodgers
Second solution: (by Calvin Lin) As in the first solu-
for pointing out the d = 1 restriction.)
tion, we may compute the probability that for a particu-
lar one of the points Q1 , the angle at Q1 is not acute but To check that these are all solutions, put b = log(a) and
the following angle is, and then multiply by n. Imagine y = log(a/x); rewrite the given equation as
picking the points by first choosing Q1 , then picking
f (eb−y )f 0 (ey ) = eb−y .
n − 1 pairs of antipodal points and then picking one
member of each pair. Let R2 , . . . , Rn be the points of Put
the pairs which lie in the semicircle, taken in order away
from Q1 , and let S2 , . . . , Sn be the antipodes of these. g(y) = log f (ey );
Then to get the desired situation, we must choose from then the given equation rewrites as
the pairs to end up with all but one of the Si , and we
cannot take Rn and the other Si or else ∠Q1 will be g(b − y) + log g 0 (y) + g(y) − y = b − y,
acute. That gives us (n − 2) good choices out of 2n−1 ;
since we could have chosen Q1 to be any of the n points, or
the probability is again n(n − 2)2−n+1 . log g 0 (y) = b − g(y) − g(b − y).
B1 Take P (x, y) = (y − 2x)(y − 2x − 1). To see that By the symmetry of the right side, we have g 0 (b − y) =
this works, first note that if m = bac, then 2m is an g 0 (y). Hence the function g(y) + g(b − y) has zero
integer less than or equal to 2a, so 2m ≤ b2ac. On derivative and so is constant, as then is g 0 (y). From
the other hand, m + 1 is an integer strictly greater than this we deduce that f (x) = cxd for some c, d, both
a, so 2m + 2 is an integer strictly greater than 2a, so necessarily positive since f 0 (x) > 0 for all x.
b2ac ≤ 2m + 1.
Second solution: (suggested by several people) Substi-
B2 By the arithmetic-harmonic mean inequality or the tute a/x for x in the given equation:
Cauchy-Schwarz inequality, a
f 0 (x) = .
xf (a/x)

1 1
(k1 + · · · + kn ) + ··· + ≥ n2 .
k1 kn Differentiate:
2
We must thus have 5n − 4 ≥ n , so n ≤ 4. Without a a2 f 0 (a/x)
f 00 (x) = − + .
loss of generality, we may suppose that k1 ≤ · · · ≤ kn . x2 f (a/x) x3 f (a/x)2

www.adultpdf.com
5
Now substitute to eliminate evaluations at a/x: Third solution: (by Greg Martin) As in the second so-
lution, it is convenient to allow f (m, 0) = f (0, n) = 1.
f 0 (x) f 0 (x)2 Define the generating function
f 00 (x) = − + .
x f (x)
∞ X
X ∞
Clear denominators: G(x, y) = f (m, n)xm y n .
m=0 n=0
xf (x)f 00 (x) + f (x)f 0 (x) = xf 0 (x)2 .
As equalities of formal power series (or convergent se-
Divide through by f (x)2 and rearrange: ries on, say, the region |x|, |y| < 31 ), we have
f 0 (x) xf 00 (x) xf 0 (x)2 XX X
0= + − . G(x, y) = xm y n 1
f (x) f (x) f (x)2
m≥0 n≥0 k1 , ..., kn ∈Z
0 |k1 |+···+|kn |≤m
The right side is the derivative of xf (x)/f (x), so that X X X
quantity is constant. That is, for some d, = yn xm
n≥0 k1 , ..., kn ∈Z m≥|k1 |+···+|kn |
f 0 (x) d
= . x|k1 |+···+|kn |
f (x) x
X X
= yn
1−x
n≥0 k1 , ..., kn ∈Z
Integrating yields f (x) = cxd , as desired. n
1 X
n
X
|k|
B4 First solution: Define f (m, n, k) as the number of n- = y x
1−x
tuples (x1 , x2 , . . . , xn ) of integers such that |x1 |+· · ·+ n≥0 k∈Z
n
|xn | ≤ m and exactly k of x1 , . . . , xn are nonzero. To

1 X n 1+x
choose such a tuple, we may choose the k nonzero posi- = y
1−x 1−x
tions, the signs of those k numbers, and then an ordered n≥0
k-tuple of positive integers with sum ≤ m. There are 1 1

n
k = ·
k options for the first choice,
m
and 2 for the second. 1 − x 1 − y(1 + x)/(1 − x)
As for the third, we have k options by a “stars and 1
bars” argument: depict the k-tuple by drawing a num- = .
1 − x − y − xy
ber of stars for each term, separated by bars, and adding
stars at the end to get a total of m stars. Then each tu- Since G(x, y) = G(y, x), it follows that f (m, n) =
ple corresponds to placing k bars, each in a different f (n, m) for all m, n ≥ 0.
position behind one of the m fixed stars.
B5 First solution: Put Q = x21 + · · · + x2n . Since Q is
We conclude that homogeneous, P is divisible by Q if and only if each of
the homogeneous components of P is divisible by Q. It

m n
f (m, n, k) = 2k = f (n, m, k); is thus sufficient to solve the problem in case P itself is
k k
homogeneous, say of degree d.
summing over k gives f (m, n) = f (n, m). (One may Suppose that we have a factorization P = Qm R for
also extract easily a bijective interpretation of the equal- some m > 0, where R is homogeneous of degree d and
ity.) not divisible by Q; note that the homogeneity implies
Second solution: (by Greg Kuperberg) It will be con- that
venient to extend the definition of f (m, n) to m, n ≥ 0, n
in which case we have f (0, m) = f (n, 0) = 1. X ∂R
xi = dR.
Let Sm,n be the set of n-tuples (x1 , . . . , xn ) of inte- i=1
∂xi
gers such that |x1 | + · · · + |xn | ≤ m. Then elements
∂2 ∂2
of Sm,n can be classified into three types. Tuples with Write ∇2 as shorthand for ∂x21
+ ··· + ∂x2n ; then
|x1 | + · · · + |xn | < m also belong to Sm−1,n . Tuples
with |x1 | + · · · + |xn | = m and xn ≥ 0 correspond 0 = ∇2 P
to elements of Sm,n−1 by dropping xn . Tuples with n
|x1 | + · · · + |xn | = m and xn < 0 correspond to ele-
X ∂R
= 2mnQm−1 R + Qm ∇2 R + 2 2mxi Qm−1
ments of Sm−1,n−1 by dropping xn . It follows that i=1
∂xi
f (m, n) = Qm ∇2 R + (2mn + 4md)Qm−1 R.

= f (m − 1, n) + f (m, n − 1) + f (m − 1, n − 1), Since m > 0, this forces R to be divisible by Q, con-
so f satisfies a symmetric recurrence with symmetric tradiction.
boundary conditions f (0, m) = f (n, 0) = 1. Hence f Second solution: (by Noam Elkies) Retain notation as
is symmetric. in the first solution. Let Pd be the set of homogeneous

www.adultpdf.com
6
polynomials of degree d, and let Hd be the subset of Integrating both sides from 0 to 1 (and substituting y =
Pd of polynomials killed by ∇2 , which has dimension 1 − x) yields
≥ dim(Pd ) − dim(Pd−2 ); the given problem amounts Z 1
to showing that this inequality is actually an equality. X sgn(π)
= (x + n − 1)(x − 1)n−1 dx
Consider the operator Q∇2 (i.e., apply ∇2 then multi- ν(π) + 1 0
π∈Sn
ply by Q) on Pd ; its zero eigenspace is precisely Hd . Z 1
By the calculation from the first solution, if R ∈ Pd , = (−1)n+1 (n − y)y n−1 dy
then 0
n
= (−1)n+1 ,
2 2
∇ (QR) − Q∇ R = (2n + 4d)R. n+1
as desired.
Consequently, Qj Hd−2j is contained in the eigenspace
of Q∇2 on Pd of eigenvalue Second solution: We start by recalling a form of the
principle of inclusion-exclusion: if f is a function on
(2n + 4(d − 2j)) + · · · + (2n + 4(d − 2)). the power set of {1, . . . , n}, then
In particular, the Qj H d−2j lie in distinct eigenspaces,

X X
f (S) = (−1)|T |−|S| f (U ).
so are linearly independent within Pd . But by dimen- T ⊇S U ⊇T
sion counting, their total dimension is at least that of Pd .
Hence they exhaust Pd , and the zero eigenspace cannot In this case we take f (S) to be the sum of σ(π) over all
have dimension greater than dim(Pd ) − dim(Pd−2 ), as permutations π whose fixed points are exactly S. Then
desired.
P
U ⊇T f (U ) = 1 if |T | ≥ n − 1 and 0 otherwise (since
Third solution: (by Richard Stanley) Write x = a permutation group on 2 or more symbols has as many
∂
(x1 , . . . , xn ) and ∇ = ( ∂x , . . . , ∂x∂n ). Suppose that even and odd permutations), so
1
P (x) = Q(x)(x21 + · · · + x2n ). Then
f (S) = (−1)n−|S| (1 − n + |S|).
P (∇)P (x) = Q(∇)(∇2 )P (x) = 0.
The desired sum can thus be written, by grouping over
On the other hand, if P (x) =
P α fixed point sets, as
α cα x (where α =
(α1 , . . . , αn ) and xα = xα
1
1
· · · xαn
n ), then the constant n
term of P (∇)P (x) is seen to be α c2α . Hence cα = 0
P X n 1−n+i
(−1)n−i
for all α. i=0
i i+1
n n
Remarks: The first two solutions apply directly over

n−i n n−i n n
X X
any field of characteristic zero. (The result fails in char- = (−1) − (−1)
i i+1 i
acteristic p > 0 because we may take P = (x21 + i=0 i=0
n
· · · + x2n )p = x2p 2p

1 + · · · + xn .) The third solution
X n n+1
=0− (−1)n−i
can be extended to complex coefficients by replacing n + 1 i+1
i=0
P (∇) by its complex conjugate, and again the result n
may be deduced for any field of characteristic zero. = (−1)n+1 .
n+1
Stanley also suggests Section 5 of the arXiv e-print
math.CO/0502363 for some algebraic background
for this problem. Third solution: (by Richard Stanley) The cycle indica-
tor of the symmetric group Sn is defined by
B6 First solution: Let I be the identity matrix, and let
c (π)
X
Jx be the matrix with x’s on the diagonal and 1’s else- Zn (x1 , . . . , xn ) = x11 · · · xcnn (π) ,
where. Note that Jx − (x − 1)I, being the all 1’s matrix, π∈Sn
has rank 1 and trace n, so has n − 1 eigenvalues equal
to 0 and one equal to n. Hence Jx has n−1 eigenvalues where ci (π) is the number of cycles of π of length i.
equal to x − 1 and one equal to x + n − 1, implying Put
X
det Jx = (x + n − 1)(x − 1)n−1 . Fn = σ(π)xν(π) = Zn (x, −1, 1, −1, 1, . . . )
π∈Sn
On the other hand, we may expand the determinant as a
sum indexed by permutations, in which case we get and
Z 1
X X σ(π)
det Jx = sgn(π)xν(π) . f (n) = = Fn (x) dx.
ν(π) + 1 0
π∈Sn π∈Sn

www.adultpdf.com
7
A standard argument in enumerative combinatorics (the by induction on n, which for x = 1 implies the desired
Exponential Formula) gives result. (This can also be deduced as in the other solu-
tions, but in this argument it is necessary to formulate
∞ ∞
X tn X tk the strong induction hypothesis.)
Zn (x1 , . . . , xn ) = exp xk ,
n=0
n! k
k=1
Let R(n, x) be the right hand side of the above equa-
yielding tion. It is easy to verify that
∞ 1
tn t2 t3
X Z
f (n) = exp xt − + − · · · dx
n=0
n! 0 2 3 (−1)n+1
R(x, n) = R(x + 1, n − 1) + (n − 1)!
Z 1 x
= e(x−1)t+log(1+t) dx n−1
X (n − 1)!
0 + (−1)l−1 R(x, n − l),
Z 1 (n − l)!
l=2
= (1 + t)e(x−1)t dx
0
1
= (1 − e−t )(1 + t). since the sum telescopes. To prove the desired equality,
t
it suffices to show that the left hand side satisfies the
Expanding the right side as a Taylor series and compar- same recurrence. This follows because we can classify
ing coefficients yields the desired result. each π ∈ Sn as either fixing n, being an n-cycle, or hav-
Fourth solution (sketch): (by David Savitt) We prove ing n in an l-cycle for one of l = 2, . . . , n − 1; writing
the identity of rational functions the sum over these classes gives the desired recurrence.
X σ(π) (−1)n+1 n!(x + n − 1)

=
ν(π) + x x(x + 1) · · · (x + n)
π∈Sn

www.adultpdf.com
We change to cylindrical coordinates, i.e., we put r =

A1 p where n is fixed and f is a fixed polynomial of n vari-
x2 + y 2 . Then the given inequality is equivalent to ables with integer coefficients, for any positive integer
N , the sequence modulo N is eventually periodic. This
r2 + z 2 + 8 ≤ 6r, is simply because there are only finitely many possible
sequences of n consecutive values modulo N , and once
or
such a sequence is repeated, every subsequent value is
(r − 3)2 + z 2 ≤ 1. repeated as well.
We next observe that if one can rewrite the same recur-
This defines a solid of revolution (a solid torus); the sion as
area being rotated is the disc (x − 3)2 + z 2 ≤ 1 in
the xz-plane. By Pappus’s theorem, the volume of this xk−n = g(xk−n+1 , . . . , xk ) (k > n),
equals the area of this disc, which is π, times the dis-
tance through which the center of mass is being rotated, where g is also a polynomial with integer coefficients,
which is (2π)3. That is, the total volume is 6π 2 . then the sequence extends uniquely to a doubly infinite
sequence . . . , x−1 , x0 , x1 , . . . which is fully periodic
A2 Suppose on the contrary that the set B of values of modulo any N . That is the case in the situation at hand,
n for which Bob has a winning strategy is finite; for because we can rewrite the given recursion as
convenience, we include n = 0 in B, and write B =
{b1 , . . . , bm }. Then for every nonnegative integer n not xk−2005 = xk+1 − xk .
in B, Alice must have some move on a heap of n stones
leading to a position in which the second player wins. It thus suffices to find 2005 consecutive terms divisible
That is, every nonnegative integer not in B can be writ- by N in the doubly infinite sequence, for any fixed N
ten as b+p−1 for some b ∈ B and some prime p. How- (so in particular for N = 2006). Running the recursion
ever, there are numerous ways to show that this cannot backwards, we easily find
happen.
First solution: Let t be any integer bigger than all of x1 = x0 = · · · = x−2004 = 1
the b ∈ B. Then it is easy to write down t consecutive x−2005 = · · · = x−4009 = 0,
composite integers, e.g., (t+1)!+2, . . . , (t+1)!+t+1.
Take n = (t + 1)! + t; then for each b ∈ B, n − b + 1 yielding the desired result.
is one of the composite integers we just wrote down. A4 First solution: By the linearity of expectation, the av-
Second solution: Let p1 , . . . , p2m be any prime num- erage number of local maxima is equal to the sum of
bers; then by the Chinese remainder theorem, there ex- the probability of having a local maximum at k over
ists a positive integer x such that k = 1, . . . , n. For k = 1, this probability is 1/2: given
the pair {π(1), π(2)}, it is equally likely that π(1) or
x − b1 ≡ −1 (mod p1 pm+1 ) π(2) is bigger. Similarly, for k = n, the probability is
... 1/2. For 1 < k < n, the probability is 1/3: given the
x − bn ≡ −1 (mod pm p2m ). pair {π(k − 1), π(k), π(k + 1)}, it is equally likely that
any of the three is the largest. Thus the average number
For each b ∈ B, the unique integer p such that x = of local maxima is
b + p − 1 is divisible by at least two primes, and so
cannot itself be prime. 1 1 n+1
2· + (n − 2) · = .
2 3 3
Third solution: (by Catalin Zara) Put b1 = 0, and take
n = (b2 − 1) · · · (bm − 1); then n is composite because Second solution: Another way to apply the linear-
3, 8 ∈ B, and for any nonzero b ∈ B, n − bi + 1 is ity of expectation is to compute the probability that
divisible by but not equal to bi − 1. (One could also i ∈ {1, . . . , n} occurs as a local maximum. The most
take n = b2 · · · bm − 1, so that n − bi + 1 is divisible by efficient way to do this is to imagine the permutation as
bi .) consisting of the symbols 1, . . . , n, ∗ written in a circle
A3 We first observe that given any sequence of integers in some order. The number i occurs as a local maxi-
x1 , x2 , . . . satisfying a recursion mum if the two symbols it is adjacent to both belong to
the set {∗, 1, . . . , i − 1}. There are i(i − 1) pairs of such
xk = f (xk−1 , . . . , xk−n ) (k > n), symbols and n(n−1) pairs in total, so the probability of

www.adultpdf.com
2
i occurring as a local maximum is i(i − 1)/(n(n − 1)), expected value of a random variable over all choices of
and the average number of local maxima is P, Q, R. Write [XY Z] for the area of triangle XY Z.
n n If P, Q, R, S are the four points, we may ignore the case
X i(i − 1) 2 X i
= where three of them are collinear, as this occurs with
i=1
n(n − 1) n(n − 1) i=1 2 probability zero. Then the only way they can fail to
2

n+1
form the vertices of a convex quadrilateral is if one of
= them lies inside the triangle formed by the other three.
n(n − 1) 3
There are four such configurations, depending on which
n+1 point lies inside the triangle, and they are mutually ex-
= .
3 clusive. Hence the desired probability is 1 minus four
One can obtain a similar (if slightly more intricate) so- times the probability that S lies inside triangle P QR.
lution inductively, by removing the known local maxi- That latter probability is simply E([P QR]) divided by
mum n and splitting into two shorter sequences. the area of the disc.
Remark: The usual term for a local maximum in this Let O denote the center of the circle, and let P ′ , Q′ , R′
sense is a peak. The complete distribution for the num- be the projections of P, Q, R onto the circle from O.
ber of peaks is known; Richard Stanley suggests the ref- We can write
erence: F. N. David and D. E. Barton, Combinatorial
[P QR] = ±[OP Q] ± [OQR] ± [ORP ]
Chance, Hafner, New York, 1962, p. 162 and subse-
quent. for a suitable choice of signs, determined as follows. If
A5 Since the desired expression involves symmetric func- the points P ′ , Q′ , R′ lie on no semicircle, then all of the
tions of a1 , . . . , an , we start by finding a polynomial signs are positive. If P ′ , Q′ , R′ lie on a semicircle in
with a1 , . . . , an as roots. Note that that order and Q lies inside the triangle OP R, then the
sign on [OP R] is positive and the others are negative.
1 ± i tan θ = e±iθ sec θ If P ′ , Q′ , R′ lie on a semicircle in that order and Q lies
outside the triangle OP R, then the sign on [OP R] is
so that negative and the others are positive.
1 + i tan θ = e2iθ (1 − i tan θ). We first calculate
Consequently, if we put ω = e2inθ , then the polynomial E([OP Q] + [OQR] + [ORP ]) = 3E([OP Q]).
Qn (x) = (1 + ix)n − ω(1 − ix)n Write r1 = OP, r2 = OQ, θ = ∠P OQ, so that

1
has among its roots a1 , . . . , an . Since these are distinct [OP Q] = r1 r2 (sin θ).
and Qn has degree n, these must be exactly the roots. 2
If we write The distribution of r1 is given by 2r1 on [0, 1] (e.g.,
by the change of variable formula to polar coordinates),
Qn (x) = cn xn + · · · + c1 x + c0 , and similarly for r2 . The distribution of θ is uniform on
[0, π]. These three distributions are independent; hence
then a1 + · · · + an = −cn−1 /cn and a1 · · · an =
−c0 /cn , so the ratio we are seeking is cn−1 /c0 . By E([OP Q])
inspection, Z 1 2 Z π
1 2 1
cn−1 = nin−1 − ωn(−i)n−1 = nin−1 (1 − ω) = 2r dr sin(θ) dθ
2 0 π 0
c0 = 1 − ω 4
= ,
9π
so
( and
a1 + · · · + an n n ≡ 1 (mod 4)
= 4
a1 · · · an −n n ≡ 3 (mod 4). E([OP Q] + [OQR] + [ORP ]) = .
3π
Remark: The same argument shows that the ratio be- We now treat the case where P ′ , Q′ , R′ lie on a semicir-
tween any two odd elementary symmetric functions of cle in that order. Put θ1 = ∠P OQ and θ2 = ∠QOR;
a1 , . . . , an is independent of θ. then the distribution of θ1 , θ2 is uniform on the region
A6 First solution: (by Daniel Kane) The probability is 0 ≤ θ1 , 0 ≤ θ2 , θ1 + θ2 ≤ π.
35
1 − 12π 2 . We start with some notation and simplifi-
cations. For simplicity, we assume without loss of gen- In particular, the distribution on θ = θ1 + θ2 is π2θ2 on
erality that the circle has radius 1. Let E denote the [0, π]. Put rP = OP, rQ = OQ, rR = OR. Again, the

www.adultpdf.com
3
distribution on rP is given by 2rP on [0, 1], and simi- the lines P Q, QR, RP , which with probability 1 di-
larly for rQ , rR ; these are independent from each other vide the interior of the circle into seven regions. Put
and from the joint distribution of θ1 , θ2 . Write E ′ (X) a = [P QR], let b1 , b2 , b3 denote the areas of the three
for the expectation of a random variable X restricted to other regions sharing a side with the triangle, and let
this part of the domain. c1 , c2 , c3 denote the areas of the other three regions.
Let χ be the random variable with value 1 if Q is inside Put A = E(a), B = E(b1 ), C = E(c1 ), so that
triangle OP R and 0 otherwise. We now compute A + 3B + 3C = π.
Note that c1 + c2 + c3 + a is the area of the region
E ′ ([OP R]) in which we can choose a fourth point S so that the
Z 1 2 Z π quadrilateral P QRS fails to be convex. By comparing
1 2 2θ
= 2r dr 2
sin(θ) dθ expectations, we have 3C + A = 4A, so A = C and
2 0 0 π 4A + 3B = π.
4
= We will compute B + 2A = B + 2C, which is the ex-
9π pected area of the part of the circle cut off by a chord
E ′ (χ[OP R]) through two random points D, E, on the side of the
= E ′ (2[OP R]2 /θ) chord not containing a third random point F . Let h be
Z 1 2 Z π the distance from the center O of the circle to the line
1 2θ −1 2 DE. We now determine the distribution of h.
= 2r3 dr 2
θ sin (θ) dθ
2 0 0 π Put r = OD; the distribution of r is 2r on [0, 1]. With-
1 out loss of generality, suppose O is the origin and D
= .
8π lies on the positive x-axis. For fixed r, the distribution
Also recall that given any triangle XY Z, if T is chosen of h runs over [0, r], and can be computed as the area
uniformly at random inside XY Z, the expectation of of the infinitesimal region in which E can be chosen so
[T XY ] is the area of triangle bounded by XY and the the chord through DE has distance to O between h and
centroid of XY Z, namely 31 [XY Z]. h + dh, divided by π. This region splits into two sym-
metric pieces, one of which lies between chords making
Let χ be the random variable with value 1 if Q is inside angles of arcsin(h/r) and arcsin((h + dh)/r) with the
triangle OP R and 0 otherwise. Then x-axis. The angle between these is dθ = dh/(r2 − h2 ).
Draw the chord through D at distance h to O, and let
E ′ ([OP Q] + [OQR] + [ORP ] − [P QR]) L1 , L2 be the lengths of the parts on opposite sides of
= 2E ′ (χ([OP Q] + [OQR]) + 2E ′ ((1 − χ)[OP R]) D; then the area we are looking for is 21 (L21 + L22 )dθ.
2 Since
= 2E ′ ( χ[OP R]) + 2E ′ ([OP R]) − 2E ′ (χ[OP R])
3
p p
{L1 , L2 } = 1 − h2 ± r2 − h2 ,
2 29
= 2E ([OP R]) − E ′ (χ[OP R]) =
′
. the area we are seeking (after doubling) is
3 36π
Finally, note that the case when P ′ , Q′ , R′ lie on a semi- 1 + r2 − 2h2
2 √ .
circle in some order occurs with probability 3/4. (The r 2 − h2
case where they lie on a semicircle proceeding clock-
Dividing by π, then integrating over r, we compute the
wise from P ′ to its antipode has probability 1/4; this
distribution of h to be
case and its two analogues are exclusive and exhaus-
1 1 1 + r2 − 2h2
Z
tive.) Hence
2 √ 2r dr
π h r 2 − h2
E([P QR])
16
= E([OP Q] + [OQR] + [ORP ]) = (1 − h2 )3/2 .
3π
3
− E ′ ([OP Q] + [OQR] + [ORP ] − [P QR]) We now return to computing B + 2A. Let A(h) de-
4
4 29 35 note the smaller of the two areas of the disc cut off by
= − = , a chord at distance h. The chance that the third point
3π 48π 48π
is in the smaller (resp. larger) portion is A(h)/π (resp.
so the original probability is 1−A(h)/π), and then the area we are trying to compute
is π − A(h) (resp. A(h)). Using the distribution on h,
4E([P QR]) 35 and the fact that
1− =1− .
π 12π 2 Z 1p
A(h) = 2 1 − h2 dh
Second solution: (by David Savitt) As in the first so- h
lution, it suffices to check that for P, Q, R chosen uni- π p
35 = − arcsin(h) − h 1 − h2 ,
formly at random in the disc, E([P QR]) = 48π . Draw 2

www.adultpdf.com
4
we find length of the altitude from (−1,

√ −1) is the distance from
(−1, −1) to (1/2, 1/2), or 3 2/2.√The area of an equi-
B + 2A lateral triangle of height h is h2 3/3, so the desired
√
2 1 16 area is 3 3/2.
Z
= A(h)(π − A(h)) (1 − h2 )3/2 dh
π 0 3π Remark: The factorization used above is a special case
35 + 24π 2 of the fact that
= .
72π
x3 + y 3 + z 3 − 3xyz
35
Since 4A + 3B = π, we solve to obtain A = 48π as in = (x + y + z)(x + ωy + ω 2 z)(x + ω 2 y + ωz),
the first solution.
Third solution: (by Noam Elkies) Again, we reduce where ω denotes a primitive cube root of unity. That
to computing the average area of a triangle formed fact in turn follows from the evaluation of the determi-
by three random points A, B, C inside a unit cir- nant of the circulant matrix
cle. Let O be the center of the circle, and put c =  
max{OA, OB, OC}; then the probability that c ≤ r x y z
z x y 
is (r2 )3 , so the distribution of c is 6c5 dc on [0, 1].
y z x
Given c, the expectation of [ABC] is equal to c2 times
X, the expected area of a triangle formed by two ran- by reading off the eigenvalues of the eigenvectors
dom points P, Q in a circle and a fixed point R on (1, ω i , ω 2i ) for i = 0, 1, 2.
the boundary. We introduce polar coordinates centered
at R, in which the circle is given by r = 2 sin θ for B2 Let {x} = x − ⌊x⌋ denote the fractional part of x. For
θ ∈ [0, π]. The distribution of a random point in that i = 0, . . . , n, put si = x1 + · · · + xi (so that s0 = 0).
circle is π1 r dr dθ over θ ∈ [0, π] and r ∈ [0, 2 sin θ]. Sort the numbers {s0 }, . . . , {sn } into ascending order,
If (r, θ) and (r′ , θ′ ) are the two random points, then the and call the result t0 , . . . , tn . Since 0 = t0 ≤ · · · ≤
area is 21 rr′ sin |θ − θ′ |. tn < 1, the differences
Performing the integrals over r and r′ first, we find
t1 − t0 , . . . , tn − tn−1 , 1 − tn
Z πZ π
32
X= 2 sin3 θ sin3 θ′ sin |θ − θ′ | dθ′ dθ are nonnegative and add up to 1. Hence (as in the pi-
9π 0 0
Z πZ θ geonhole principle) one of these differences is no more
64 than 1/(n + 1); if it is anything other than 1 − tn , it
= 2 sin3 θ sin3 θ′ sin(θ − θ′ ) dθ′ dθ.
9π 0 0 equals ±({si } − {sj }) for some 0 ≤ i < j ≤ n. Put
S = {xi+1 , . . . , xj } and m = ⌊si ⌋ − ⌊sj ⌋; then
This integral is unpleasant but straightforward; it yields
R1
X = 35/(36π), and E([P QR]) = 0 6c7 X dc =

X
m + s = |m + sj − si |

35/(48π), giving the desired result.
s∈S
Remark: This is one of the oldest problems in geo-
metric probability; it is an instance of Sylvester’s four- = |{sj } − {si }|
point problem, which nowadays is usually solved us- 1
≤ ,
ing a device known as Crofton’s formula. We defer to n+1
http://mathworld.wolfram.com/ for further
discussion. as desired. In case 1 − tn ≤ 1/(n + 1), we take S =
{x1 , . . . , xn } and m = −⌈sn ⌉, and again obtain the
B1 The “curve” x3 +3xy+y 3 −1 = 0 is actually reducible, desired conclusion.
because the left side factors as
B3 The maximum is n2 + 1, achieved for instance by a

(x + y − 1)(x2 − xy + y 2 + x + y + 1). convex n-gon: besides the trivial partition (in which all
of the points are in one part), each linear partition oc-
Moreover, the second factor is curs by drawing a line crossing a unique pair of edges.
First solution: We will prove that LS = n2 + 1 in any

1
((x + 1)2 + (y + 1)2 + (x − y)2 ), configuration in which no two of the lines joining points
2
of S are parallel. This suffices to imply the maximum
so it only vanishes at (−1, −1). Thus the curve in ques- in all configurations: given a maximal configuration,
tion consists of the single point (−1, −1) together with we may vary the points slightly to get another maximal
the line x + y = 1. To form a triangle with three points configuration in which our hypothesis is satisfied. For
on this curve, one of its vertices must be (−1, −1). The convenience, we assume n ≥ 3, as the cases n = 1, 2
other two vertices lie on the line x + y = 1, so the are easy.

www.adultpdf.com
5
Let P be the line at infinity in the real projective plane; the segment O′ P . If we consider the dual affine plane
i.e., P is the set of possible directions of lines in the as being divided into regions by the lines of S ′ , then the
plane, viewed as a circle. Remove the directions corre- lines of S ′ crossing the segment O′ P are determined by
sponding to lines through two points of S; this leaves which region P lies in.
behind n2 intervals. Thus our original maximum is equal to the maximum
Given a direction in one of the intervals, consider the number of regions into which n−1 lines divide an affine
set of linear partitions achieved by lines parallel to that plane. Byinduction on n, this number is easily seen to
direction. Note that the resulting collection of partitions be 1 + n2 .
depends only on the interval. Then note that the collec- Remark: Given a finite set S of points in Rn , a non-
tions associated to adjacent intervals differ in only one Radon partition of S is a pair (A, B) of complementary
element. subsets that can be separated by a hyperplane. Radon’s
The trivial partition that puts all of S on one side is theorem states that if #S ≥ n+2, then not every (A, B)
in every such collection. We now observe that for any is a non-Radon partition. The result of this problem has
other linear partition {A, B}, the set of intervals to been greatly extended, especially within the context of
which {A, B} is: matroid theory and oriented matroid theory. Richard
Stanley suggests the following references: T. H. Bry-
(a) a consecutive block of intervals, but lawski, A combinatorial perspective on the Radon con-
(b) not all of them. vexity theorem, Geom. Ded. 5 (1976), 459-466; and T.
Zaslavsky, Extremal arrangements of hyperplanes, Ann.
For (a), note that if ℓ1 , ℓ2 are nonparallel lines achieving N. Y. Acad. Sci. 440 (1985), 69-87.
the same partition, then we can rotate around their point
of intersection to achieve all of the intermediate direc- B4 The maximum is 2k , achieved for instance by the sub-
tions on one side or the other. For (b), the case n = 3 space
is evident; to reduce the general case to this case, take
points P, Q, R such that P lies on the opposite side of {(x1 , . . . , xn ) ∈ Rn : x1 = · · · = xn−k = 0}.
the partition from Q and R.
First solution: More generally, we show that any affine
It follows now that that each linear partition, except for
k-dimensional plane in Rn can contain at most 2k
the trivial one, occurs in exactly one place as the parti-
points in Z. The proof is by induction on k + n; the
tion associated to some interval but not to its immediate
case k = n = 0 is clearly true.
counterclockwise neighbor. In other words, the num-
ber of linear partitions is one more than the number of Suppose that V is a k-plane in Rn . Denote the hyper-
intervals, or n2 + 1 as desired. planes {xn = 0} and {xn = 1} by V0 and V1 , respec-

tively. If V ∩ V0 and V ∩ V1 are each at most (k − 1)-
Second solution: We prove the upper bound by induc-
dimensional, then V ∩ V0 ∩ Z and V ∩ V1 ∩ Z each have
tion on n. Choose a point P in the convex hull of S. cardinality at most 2k−1 by the induction assumption,
Put S ′ = S \ {P }; by the induction hypothesis, there
and hence V ∩ Z has at most 2k elements. Otherwise,
are at most n−12 + 1 linear partitions of S ′ . Note that if V ∩ V0 or V ∩ V1 is k-dimensional, then V ⊂ V0
each linear partition of S restricts to a linear partition
or V ⊂ V1 ; now apply the induction hypothesis on V ,
of S ′ . Moreover, if two linear partitions of S restrict to viewed as a subset of Rn−1 by dropping the last coor-
the same linear partition of S ′ , then that partition of S ′
dinate.
is achieved by a line through P .
Second solution: Let S be a subset of Z contained in
By rotating a line through P , we see that there are at a k-dimensional subspace of V . This is equivalent to
most n − 1 partitions of S ′ achieved by lines through asking that any t1 , . . . , tk+1 ∈ S satisfy a nontrivial
P : namely, the partition only changes when the rotating linear dependence c1 t1 + · · · + ck+1 tk+1 = 0 with
line passes through one of the points of S. This yields c1 , . . . , ck+1 ∈ R. Since t1 , . . . , tk+1 ∈ Qn , given
the desired result. such a dependence we can always find another one with
Third solution: (by Noam Elkies) We enlarge the plane c1 , . . . , ck+1 ∈ Q; then by clearing denominators, we
to a projective plane by adding a line at infinity, then can find one with c1 , . . . , ck+1 ∈ Z and not all having a
apply the polar duality map centered at one of the points common factor.
O ∈ S. This turns the rest of S into a set S ′ of n − 1 Let F2 denote the field of two elements, and let S ⊆ Fn2
lines in the dual projective plane. Let O′ be the point be the reductions modulo 2 of the points of S. Then any
in the dual plane corresponding to the original line at t1 , . . . , tk+1 ∈ S satisfy a nontrivial linear dependence,
infinity; it does not lie on any of the lines in S ′ . because we can take the dependence from the end of
Let ℓ be a line in the original plane, corresponding to a the previous paragraph and reduce modulo 2. Hence S
point P in the dual plane. If we form the linear partition is contained in a k-dimensional subspace of F2n , and
induced by ℓ, then the points of S \ {O} lying in the the latter has cardinality exactly 2k . Thus S has at most
same part as O correspond to the lines of S ′ which cross 2k elements, as does S.

www.adultpdf.com
6
Variant (suggested by David Savitt): if S contained k + In general, if xn is a sequence with limn→∞ xn = c,

1 linearly independent elements, the (k + 1) × n matrix then also
formed by these would have a nonvanishing maximal n
minor. The lift of that minor back to R would also not 1X
lim xi = c
vanish, so S would contain k + 1 linearly independent n→∞ n
i=1
elements.
Third solution: (by Catalin Zara) Let V be a k- by Cesaro’s lemma. Explicitly, for any ǫ > 0, we can
dimensional subspace. Form the matrix whose rows are find N such that |xn − c| ≤ ǫ/2 for n ≥ N , and then
the elements of V ∩ Z; by construction, it has row rank
n N
at most k. It thus also has column rank at most k; in 1 X n − N ǫ N X
c − xi ≤ + (c − xi ) ;

particular, we can choose k coordinates such that each n n 2 n
point of V ∩ Z is determined by those k of its coordi- i=1 i=1
nates. Since each coordinate of a point in Z can only for n large, the right side is smaller than ǫ.
take two values, V ∩ Z can have at most 2k elements.
In our case, we deduce that
Remark: The proposers probably did not
realize that this problem appeared online (k+1)/k
an k+1
about three months before the exam, at lim =
http://www.artofproblemsolving.com/ n→∞ n k
Forum/viewtopic.php?t=105991. (It may and so
very well have also appeared even earlier.)
k
ak+1

n k+1
B5 The answer is 1/16. We have lim = ,
n→∞ nk k
Z 1 Z 1
2
x f (x) dx − xf (x)2 dx as desired.
0 0
Z 1 Remark: The use of Cesaro’s lemma above is the spe-
= (x3 /4 − x(f (x) − x/2)2 ) dx cial case bn = n of the Cesaro-Stolz theorem: if an , bn
0 are sequences such that bn is positive, strictly increas-
Z 1
≤ x3 /4 dx = 1/16, ing, and unbounded, and
0
an+1 − an
with equality when f (x) = x/2. lim = L,
n→∞ bn+1 − bn
B6 First solution: We start with some easy upper and then
lower bounds on an . We write O(f (n)) and Ω(f (n))
for functions g(n) such that f (n)/g(n) and g(n)/f (n), an
lim = L.
respectively, are bounded above. Since an is a non- n→∞ bn
decreasing sequence, an+1 − an is bounded above, so
−1/k Second solution: In this solution, rather than applying
an = O(n). That means an = Ω(n−1/k ), so
Taylor’s theorem with remainder to (1 + x)m for 1 <
n
!
X m < 2 and x > 0, we only apply convexity to deduce
an = Ω i−1/k = Ω(n(k−1)/k ). that (1 + x)m ≥ 1 + mx. This gives
i=1
In fact, all we will need is that an → ∞ as n → ∞. (k+1)/k k+1

an+1 − an(k+1)/k ≥ ,
k
By Taylor’s theorem with remainder, for 1 < m < 2
and x > 0, and so
m(m − 1) 2 k+1
|(1 + x)m − 1 − mx| ≤ x . an(k+1)/k ≥ n+c
2 k
Taking m = (k + 1)/k and x = an+1 /an = 1 + for some c ∈ R. In particular,
−(k+1)/k
an , we obtain
(k+1)/k
an k+1
(k+1)/k
a (k+1)/k k + 1 k + 1 −(k+1)/k lim inf ≥
− a n − ≤ a . n→∞ n k
n+1 k 2k 2 n
and so
In particular,
k/(k+1)
(k+1)/k k+1 an k+1
lim a − an(k+1)/k = . lim inf ≥ .
n→∞ n+1 k n→∞ nk/(k+1) k

www.adultpdf.com
7
But turning this around, the fact that Note that both bounds have sign opposite to bn ; more-
over, by the bound an = Ω(n(k−1)/k ), both bounds
an+1 − an have absolutely value strictly less than that of bn for n
= a−1/k sufficiently large. Consequently, for n large,
n
−1/(k+1)
k+1 |e1 | ≤ |bn |.
≤ n−1/(k+1) (1 + o(1)),
k We now work on e2 . By Taylor’s theorem with remain-
der applied to (1 + x)m for x > 0 and 0 < m < 1,
where o(1) denotes a function tending to 0 as n → ∞,
yields 1 + mx ≥ (1 + x)m
m(m − 1) 2
an ≥ 1 + mx + x .
2
−1/(k+1) Xn
k+1
≤ i−1/(k+1) (1 + o(1)) The “main term” of L((n + 1)k/(k+1) − nk/(k+1) )
k k
i=1 is L k+1 n−1/(k+1) . To make this coincide with
−1/(k+1) −1/k −1/(k+1)
k+1 k+1 L n , we take
= nk/(k+1) (1 + o(1))
k k k/(k+1)
k/(k+1) k+1
k+1 L= .
= nk/(k+1) (1 + o(1)), k
k
so We then find that
an

k+1
k/(k+1) |e2 | = O(n−2 ),
lim sup ≤
n→∞ nk/(k+1) k
and because bn+1 = e1 + e2 , we have |bn+1 | ≤ |bn | +
and this completes the proof. |e2 |. Hence
Third solution: We argue that an → ∞ as in the first n
!
solution. Write bn = an − Lnk/(k+1) , for a value of L
X
−2
|bn | = O i = O(1),
to be determined later. We have i=1
bn+1 and so
k/(k+1) k/(k+1)
= bn + a−1/k
n − L((n + 1) −n ) ak+1

k+1
k
n
= e1 + e2 , lim = Lk+1 = .
n→∞ nk k
where
Remark: The case k = 2 appeared on the 2004 Roma-
e1 = bn + a−1/k
n − L−1/k n−1/(k+1) nian Olympiad (district level).
e2 = L((n + 1)k/(k+1) − nk/(k+1) ) Remark: One can make a similar argument for any se-
quence given by an+1 = an + f (an ), when f is a de-
− L−1/k n−1/(k+1) . creasing function.
We first estimate e1 . For −1 < m < 0, by the convexity Remark: Richard Stanley suggests a heuristic for de-
of (1 + x)m and (1 + x)1−m , we have termining the asymptotic behavior of sequences of this
type: replace the given recursion
1 + mx ≤ (1 + x)m
≤ 1 + mx(1 + x)m−1 . an+1 − an = a−1/k
n
Hence by the differential equation
1 y ′ = y −1/k
− L−(k+1)/k n−1 bn ≤ e1 − bn
k
1 and determine the asymptotics of the latter.
≤ − bn an−(k+1)/k .
k

www.adultpdf.com
√
A1 The only such α are 2/3, 3/2, (13 ± 601)/12. Second solution: For any nonzero value of α, the two
First solution: Let C1 and C2 be the curves y = αx2 + conics will intersect in four points in the complex pro-
αx + 241 1
and x = αy 2 + αy + 24 , respectively, and let jective plane P2 (C). To determine the y-coordinates of
L be the line y = x. We consider three cases. these intersection points, subtract the two equations to
obtain
If C1 is tangent to L, then the point of tangency (x, x)
satisfies (y − x) = α(x − y)(x + y) + α(x − y).
1 Therefore, at a point of intersection we have either
2αx + α = 1, x = αx2 + αx + ;
24 x = y, or x = −1/α − (y + 1). Substituting these
two possible linear conditions into the second equation
by symmetry, C2 is tangent to L there, so C1 and C2 are shows that the y-coordinate of a point of intersection is
tangent. Writing α = 1/(2x + 1) in the first equation a root of either Q1 (y) = αy 2 + (α − 1)y + 1/24 or
and substituting into the second, we must have Q2 (y) = αy 2 + (α + 1)y + 25/24 + 1/α.
x2 + x 1 If two curves are tangent, then the y-coordinates of at
x= + , least two of the intersection points will coincide; the
2x + 1 24
converse is also true because one of the curves is the
which simplifies to 0 = 24x2 − 2x− 1 = (6x+ 1)(4x− graph of a function in x. The coincidence occurs pre-
1), or x ∈ {1/4, −1/6}. This yields α = 1/(2x + 1) ∈ cisely when either the discriminant of at least one of
{2/3, 3/2}. Q1 or Q2 is zero, or there is a common root of Q1 and
Q2 . Computing the discriminants of Q1 and Q2 yields
If C1 does not intersect L, then C1 and C2 are separated
(up to constant factors) f1 (α) = 6α2 − 13α + 6 and
by L and so cannot be tangent.
f2 (α) = 6α2 − 13α − 18, respectively. If on the other
If C1 intersects L in two distinct points P1 , P2 , then it hand Q1 and Q2 have a common root, it must be also
is not tangent to L at either point. Suppose at one of a root of Q2 (y) − Q1 (y) = 2y + 1 + 1/α, yielding
these points, say P1 , the tangent to C1 is perpendicular y = −(1 + α)/(2α) and 0 = Q1 (y) = −f2 (α)/(24α).
to L; then by symmetry, the same will be true of C2 , so Thus the values of α for which the two curves are tan-
C1 and C2 will be tangent at P1 . In this case, the point gent must be contained in the√set of zeros of f1 and f2 ,
P1 = (x, x) satisfies namely 2/3, 3/2, and (13 ± 601)/12.
1 Remark: The fact that the two conics in P2 (C) meet in
2αx + α = −1, x = αx2 + αx + ; four points, counted with multiplicities, is a special case
24
of Bézout’s theorem: two curves in P2 (C) of degrees
writing α = −1/(2x + 1) in the first equation and sub- m, n and not sharing any common component meet in
stituting into the second, we have exactly mn points when counted with multiplicity.
Many solvers were surprised that the proposers chose
x2 + x 1
x=− + , the parameter 1/24 to give two rational roots and two
2x + 1 24 nonrational roots. In fact, they had no choice in the
√ matter: attempting to make all four roots rational by
or x = (−23√± 601)/72. This yields α = −1/(2x +
replacing 1/24 by β amounts to asking for β 2 + β and
1) = (13 ± 601)/12. β 2 + β + 1 to be perfect squares. This cannot happen
If instead the tangents to C1 at P1 , P2 are not perpen- outside of trivial cases (β = 0, −1) ultimately because
dicular to L, then we claim there cannot be any point the elliptic curve 24A1 (in Cremona’s notation) over Q
where C1 and C2 are tangent. Indeed, if we count inter- has rank 0. (Thanks to Noam Elkies for providing this
sections of C1 and C2 (by using C1 to substitute for y computation.)
in C2 , then solving for y), we get at most four solutions However, there are choices that make the radical milder,
counting multiplicity. Two of these are P1 and P2 , and e.g., β = 1/3 gives β 2 + β = 4/9 and β 2 + β + 1 =
any point of tangency counts for two more. However, 13/9, while β = 3/5 gives β 2 + β = 24/25 and β 2 +
off of L, any point of tangency would have a mirror im- β + 1 = 49/25.
age which is also a point of tangency, and there cannot
be six solutions. Hence we have now found all possible A2 The minimum is 4, achieved by the square with vertices
α. (±1, ±1).

www.adultpdf.com
2
First solution: To prove that 4 is a lower bound, mod 3 than to −1, the sequence mod 3 must look like
let S be a convex set of the desired form. Choose 1, 1, −1, 1, −1, . . ..
A, B, C, D ∈ S lying on the branches of the two hyper- It follows that the ordering satisfies the given condition
bolas, with A in the upper right quadrant, B in the upper if and only if the following two conditions hold: the
left, C in the lower left, D in the lower right. Then the first element in the ordering is not divisible by 3, and
area of the quadrilateral ABCD is a lower bound for the sequence mod 3 (ignoring zeroes) is of the form
the area of S. 1, 1, −1, 1, −1, . . .. The two conditions are indepen-
Write A = (a, 1/a), B = (b, −1/b), C = (−c, −1/c), dent, and the probability of the first is (2k +1)/(3k
+1)
D = (−d, 1/d) with a, b, c, d > 0. Then the area of the while the probability of the second is 1/ 2k+1 k , since
quadrilateral ABCD is 2k+1

there are k ways to order (k + 1) 1’s and k −1’s.
1 Hence the desired probability is the product of these
(a/b + b/c + c/d + d/a + b/a + c/b + d/c + a/d), k!(k+1)!
2 two, or (3k+1)(2k)! .
which by the arithmetic-geometric mean inequality is at A4 Note that n is a repunit if and only if 9n + 1 = 10m for
least 4. some power of 10 greater than 1. Consequently, if we
put
Second solution: Choose A, B, C, D as in the first so-
lution. Note that both the hyperbolas and the area of
n−1
the convex hull of ABCD are invariant under the trans- g(n) = 9f + 1,
formation (x, y) 7→ (xm, y/m) for any m > 0. For 9
m small, the counterclockwise angle from the line AC
then f takes repunits to repunits if and only if g takes
to the line BD approaches 0; for m large, this angle
powers of 10 greater than 1 to powers of 10 greater than
approaches π. By continuity, for some m this angle be-
1. We will show that the only such functions g are those
comes π/2, that is, AC and BD become perpendicular.
of the form g(n) = 10cnd for d ≥ 0, c ≥ 1 − d (all of
The area of ABCD is then AC · BD.
√ which clearly work), which will mean that the desired
It thus suffices to note that AC ≥ 2 2 (and similarly polynomials f are those of the form
for BD). This holds because if we draw the tangent
lines to the hyperbola xy = 1 at the points (1, 1) and 1
f (n) = (10c (9n + 1)d − 1)
(−1, −1), then A and C lie outside the region between 9
these lines. If we project the segment AC orthogonally
onto the line x √ = y = 1, the resulting projection has for the same c, d.
length at least 2 2, so AC must as well. It is convenient to allow “powers of 10” to be of the
Third solution: (by Richard Stanley) Choose form 10k for any integer k. With this convention, it
A, B, C, D as in the first solution. Now fixing A and suffices to check that the polynomials g taking powers
C, move B and D to the points at which the tangents of 10 greater than 1 to powers of 10 are of the form
to the curve are parallel to the line AC. This does not 10c nd for any integers c, d with d ≥ 0.
increase the area of the quadrilateral ABCD (even if First solution: Suppose that the leading term of g(x)
this quadrilateral is not convex). is axd , and note that a > 0. As x → ∞, we have
Note that B and D are now diametrically opposite; g(x)/xd → a; however, for x a power of 10 greater
write B = (−x, 1/x) and D = (x, −1/x). If we thus than 1, g(x)/xd is a power of 10. The set of powers of
repeat the procedure, fixing B and D and moving A and 10 has no positive limit point, so g(x)/xd must be equal
C to the points where the tangents are parallel to BD, to a for x = 10k with k sufficiently large, and we must
then A and C must move to (x, 1/x) and (−x, −1/x), have a = 10c for some c. The polynomial g(x) − 10c xd
respectively, forming a rectangle of area 4. has infinitely many roots, so must be identically zero.
Remark: Many geometric solutions are possible. An Second solution: We proceed by induction on d =
example suggested by David Savitt (due to Chris deg(g). If d = 0, we have g(n) = 10c for some c.
Brewer): note that AD and BC cross the positive and Otherwise, g has rational coefficients by Lagrange’s in-
negative x-axes, respectively, so the convex hull of terpolation formula (this applies to any polynomial of
ABCD contains O. Then check that the area of tri- degree d taking at least d + 1 different rational numbers
angle OAB is at least 1, et cetera. to rational numbers), so g(0) = t is rational. More-
over, g takes each value only finitely many times, so the
A3 Assume that we have an ordering of 1, 2, . . . , 3k + sequence g(100 ), g(101 ), . . . includes arbitrarily large
1 such that no initial subsequence sums to 0 mod powers of 10. Suppose that t 6= 0; then we can choose
3. If we omit the multiples of 3 from this order- a positive integer h such that the numerator of t is not
ing, then the remaining sequence mod 3 must look divisible by 10h . But for c large enough, g(10c) − t has
like 1, 1, −1, 1, −1, . . . or −1, −1, 1, −1, 1, . . .. Since numerator divisible by 10b for some b > h, contradic-
there is one more integer in the ordering congruent to 1 tion.

www.adultpdf.com
3
Consequently, t = 0, and we may apply the induction We first claim that a1 + · · · + an ≤ 4n − 6. Let V, E, F
hypothesis to g(n)/n to deduce the claim. denote the number of vertices, edges, and faces in T .
Remark: The second solution amounts to the fact that By Euler’s Formula, (F +1)−E+V = 2 (one must add
g, being a polynomial with rational coefficients, is con- 1 to the face count for the region exterior to P ). Each
tinuous for the 2-adic and 5-adic topologies on Q. By face has three edges, and each edge but the n outside
contrast, the first solution uses the “∞-adic” topology, edges belongs to two faces; hence F = 2E − n. On the
i.e., the usual real topology. other hand, each edge has two endpoints, and each of
the V − n internal vertices is an endpoint of at least 6
A5 In all solutions, let G be a finite group of order m. edges; hence a1 +· · ·+an +6(V −n) ≤ 2E. Combining
this inequality with the previous two equations gives
First solution: By Lagrange’s theorem, if m is not
divisible by p, then n = 0. Otherwise, let S be
the set of p-tuples (a0 , . . . , ap−1 ) ∈ Gp such that a1 + · · · + an ≤ 2E + 6n − 6(1 − F + E)
a0 · · · ap−1 = e; then S has cardinality mp−1 , which = 4n − 6,
is divisible by p. Note that this set is invariant under
cyclic permutation, that is, if (a0 , . . . , ap−1 ) ∈ S, then
as claimed.
(a1 , . . . , ap−1 , a0 ) ∈ S also. The fixed points under
this operation are the tuples (a, . . . , a) with ap = e; all Now set A3 = 1 and An = An−1 + 2n − 3 for n ≥ 4;
other tuples can be grouped into orbits under cyclic per- we will prove by induction on n that T has at most An
mutation, each of which has size p. Consequently, the triangles. For n = 3, since a1 + a2 + a3 = 6, a1 =
number of a ∈ G with ap = e is divisible by p; since a2 = a3 = 2 and hence T consists of just one triangle.
that number is n + 1 (only e has order 1), this proves
the claim. Next assume that an admissible triangulation of an
Second solution: (by Anand Deopurkar) Assume that (n − 1)-gon has at most An−1 triangles, and let T
n > 0, and let H be any subgroup of G of order p. Let be an admissible triangulation of an n-gon. If any
S be the set of all elements of G\H of order dividing p, ai = 2, then we can remove the triangle of T contain-
and let H act on G by conjugation. Each orbit has size ing vertex vi to obtain an admissible triangulation of an
p except for those which consist of individual elements (n−1)-gon; then the number of triangles in T is at most
g which commute with H. For each such g, g and H An−1 + 1 < An by induction. Otherwise, all ai ≥ 3.
generate an elementary abelian subgroup of G of order Now the average of a1 , . . . , an is less than 4, and thus
p2 . However, we can group these g into sets of size there are more ai = 3 than ai ≥ 5. It follows that
p2 − p based on which subgroup they generate together there is a sequence of k consecutive vertices in P whose
with H. Hence the cardinality of S is divisible by p; degrees are 3, 4, 4, . . . , 4, 3 in order, for some k with
adding the p− 1 nontrivial elements of H gives n ≡ −1 2 ≤ k ≤ n − 1 (possibly k = 2, in which case there are
(mod p) as desired. no degree 4 vertices separating the degree 3 vertices). If
we remove from T the 2k − 1 triangles which contain at
Third solution: Let S be the set of elements in G hav-
least one of these vertices, then we are left with an ad-
ing order dividing p, and let H be an elementary abelian
missible triangulation of an (n − 1)-gon. It follows that
p-group of maximal order in G. If |H| = 1, then we
there are at most An−1 +2k−1 ≤ An−1 +2n−3 = An
are done. So assume |H| = pk for some k ≥ 1, and
triangles in T . This completes the induction step and
let H act on S by conjugation. Let T ⊂ S denote
the proof.
the set of fixed points of this action. Then the size
of every H-orbit on S divides pk , and so |S| ≡ |T | Remark: We can refine the bound An somewhat. Sup-
(mod p). On the other hand, H ⊂ T , and if T con- posing that ai ≥ 3 for all i, the fact that a1 + · · · + an ≤
tained an element not in H, then that would contradict 4n − 6 implies that there are at least six more indices
the maximality of H. It follows that H = T , and so i with ai = 3 than with ai ≥ 5. Thus there exist six
|S| ≡ |T | = |H| = pk ≡ 0 (mod p), i.e., |S| = n + 1 sequences with degrees 3, 4, . . . , 4, 3, of total length at
is a multiple of p. most n + 6. We may thus choose a sequence of length
Remark: This result is a theorem of Cauchy; the first k ≤ ⌊ n6 ⌋ + 1, so we may improve the upper bound to
solution above is due to McKay. A more general (and An = An−1 + 2⌊ n6 ⌋ + 1, or asymptotically 61 n2 .
more difficult) result was proved by Frobenius: for any
positive integer m, if G is a finite group of order divis- However (as noted by Noam Elkies), a hexagonal
ible by m, then the number of elements of G of order swatch of a triangular lattice, with the boundary as close
dividing m is a multiple of m. to regular as possible, achieves asymptotically 16 n2 tri-
angles.
A6 For an admissible triangulation T , number the vertices
of P consecutively v1 , . . . , vn , and let ai be the number
of edges in T emanating from vi ; note that ai ≥ 2 for B1 The problem fails if f is allowed to be constant, e.g.,
all i. take f (n) = 1. We thus assume that f is nonconstant.

www.adultpdf.com
4
Pd √ √
Write f (n) = i=0 ai ni with ai > 0. Then Since 0 < 3 − 5 < 1, this yields ⌊xn+1 5⌋ =
3xn+1 −4xn , so we can rewrite the recursion as xn+1 =
d
X 6xn − 4xn−1 for n ≥ 2. It is routine to solve this recur-
f (f (n) + 1) = ai (f (n) + 1)i
sion to obtain the same solution as above.
i=0
≡ f (1) (mod f (n)). Remark: With an initial 1 prepended, this
becomes sequence A018903 in Sloane’s On-
If n = 1, then this implies that f (f (n) + 1) is divisible Line Encyclopedia of Integer Sequences:
by f (n). Otherwise, 0 < f (1) < f (n) since f is non- (http://www.research.att.com/˜njas/
constant and has positive coefficients, so f (f (n) + 1) sequences/). Therein, the sequence is described
cannot be divisible by f (n). as the case S(1, 5) of the sequence S(a0 , a1 )
Rx in which an+2 is the least integer for which
B2 Put B = max0≤x≤1 |f ′ (x)| and g(x) = 0 f (y) dy.
an+2 /an+1 > an+1 /an . Sloane cites D. W. Boyd,
Since g(0) = g(1) = 0, the maximum value of |g(x)|
Linear recurrence relations for some generalized Pisot
must occur at a critical point y ∈ (0, 1) satisfying
sequences, Advances in Number Theory (Kingston,
g ′ (y) = f (y) = 0. We may thus take α = y hereafter.
Rα R 1−α ON, 1991), Oxford Univ. Press, New York, 1993, p.
Since 0 f (x) dx = − 0 f (1 − x) dx, we may as- 333–340.
sume that α ≤ 1/2. By then substituting R α −f (x) for
f (x) if needed, we may assume that 0 f (x) dx ≥ 0. B4 The number of pairs is 2n+1 . The degree condition
From the inequality f ′ (x) ≥ −B, we deduce f (x) ≤ forces P to have degree n and leading coefficient ±1;
B(α − x) for 0 ≤ x ≤ α, so we may count pairs in which P has leading coefficient
Z α Z α 1 as long as we multiply by 2 afterward.
f (x) dx ≤ B(α − x) dx Factor both sides:
0 0
α
1 2
(P (X) + Q(X)i)(P (X) − Q(X)i)
= − B(α − x)
2 0 n−1
Y
α2 1 = (X − exp(2πi(2j + 1)/(4n)))
= B≤ B j=0
2 8
n−1
as desired. Y
· (X + exp(2πi(2j + 1)/(4n))).
B3 First solution: Observing that x2 /2 = 13, x3 /4 = 34, j=0
x4 /8 = 89, we guess that xn = 2n−1 F2n+3 , where
Fk is the k-th Fibonacci number. Thus we claim Then each choice of P, Q corresponds to equating
√ that
xn = 2√5 (α2n+3 − α−(2n+3) ), where α = 1+2 5 , to
n−1
P (X) + Q(X)i with the product of some n factors on
2006 the right, in which we choose exactly of the two factors
2√
make the answer x2007 = 5
(α3997 − α−3997 ). for each j = 0, . . . , n − 1. (We must take exactly n fac-
We prove the claim by induction; the base case x0 = tors because as a polynomial in X with complex coeffi-
1 is true, and so it √
suffices to show that the recursion cients, P (X) + Q(X)i has degree exactly n. We must
xn+1 = 3xn + ⌊xn 5⌋ is √satisfied for our formula for choose one for each j to ensure that P (X)+Q(X)i and
P (X) − Q(X)i are complex conjugates, so that P, Q
xn . Indeed, since α2 = 3+2 5 , we have
have real coefficients.) Thus there are 2n such pairs;
√ 2n−1 multiplying by 2 to allow P to have leading coefficient
xn+1 − (3 + 5)xn = √ (2(α2n+5 − α−(2n+5) ) −1 yields the desired result.
5
√ Remark: If we allow P and Q to have complex co-
− (3 + 5)(α2n+3 − α−(2n+3) ))
efficients but still require deg(P ) > deg(Q), then the
= 2n α−(2n+3) . number of pairs increases to 2 2n n , as we may choose
√ √ any n of the 2n factors of X 2n + 1 to use to form
Now 2n α−(2n+3) = ( 1−2 5 )3 (3 − 5)n is between −1 P (X) + Q(X)i.
and 0; the recursion follows since xn , xn+1 are integers.
B5 For n an integer, we have nk = n−j

Second solution:√(by Catalin√ Zara) Since xn is rational, k for j the unique
we have 0 < xn 5 − ⌊xn 5⌋ < 1. We now have the integer in {0, . . . , k − 1} congruent to n modulo k;
inequalities hence
√
xn+1 − 3xn < xn 5 < xn+1 − 3xn + 1 k−1
Y j nk n − j

√ √ − = 0.
(3 + 5)xn − 1 < xn+1 < (3 + 5)xn k k
√ √ j=0
4xn − (3 − 5) < (3 − 5)xn+1 < 4xn
√ √ By expanding this out, we obtain the desired polynomi-
3xn+1 − 4xn < xn+1 5 < 3xn+1 − 4xn + (3 − 5). als P0 (n), . . . , Pk−1 (n).

www.adultpdf.com
5
Remark: Variants of this solution are possible that con- For an upper bound on f (n), we use the inequalities
struct the Pi less explicitly, using Lagrange interpola- 0 ≤ ai ≤ n!/i! to deduce that there are at most n!/i! +
tion or Vandermonde determinants. 1 ≤ 2(n!/i!) choices for ai . Hence
B6 (Suggested by Oleg Golberg) Assume n ≥ 2, or else n! n!
the problem is trivially false. Throughout this proof, f (n) ≤ 2n ···
1! n!
any Ci will be a positive constant whose exact value is
= 2n 21 32 · · · nn−1
immaterial. As in the proof of Stirling’s approximation, 2
/2+C3 n −n2 /4
we estimate for any fixed c ∈ R, ≤ nn e .
n
X 1 2 1 For a lower bound on f (n), we note that if 0 ≤ ai <
(i + c) log i = n log n − n2 + O(n log n)
2 4 (n − 1)!/i! for i = 2, . . . , n − 1 and an = 0, then 0 ≤
i=1
a2 2!+· · ·+an n! ≤ n!, so there is a unique choice of a1
by comparing the sum to an integral. This gives to complete this to a solution of a1 1! + · · · + an n! = n!.
Hence
2
/2−C1 n −n2 /4
nn e ≤ 11+c 22+c · · · nn+c
(n − 1)! (n − 1)!
2
/2+C2 n −n2 /4 f (n) ≥ ···
≤ nn e . 2! (n − 1)!
We now interpret f (n) as counting the number of n- = 31 42 · · · (n − 1)n−3
2
/2+C4 n −n2 /4
tuples (a1 , . . . , an ) of nonnegative integers such that ≥ nn e .
a1 1! + · · · + an n! = n!.

www.adultpdf.com
A1 The function g(x) = f (x, 0) works. Substituting bers a′h+1 , . . . , a′n are divisible by pm while the num-
(x, y, z) = (0, 0, 0) into the given functional equation bers a′1 , . . . , a′h are not. Repeating this argument for
yields f (0, 0) = 0, whence substituting (x, y, z) = each pair (p, m) such that pm divides the initial product
(x, 0, 0) yields f (x, 0) + f (0, x) = 0. Finally, substi- a1 , . . . , an , we can determine the exact prime factoriza-
tuting (x, y, z) = (x, y, 0) yields f (x, y) = −f (y, 0) − tion of each of a′1 , . . . , a′n . This proves that the final
f (0, x) = g(x) − g(y). sequence is unique.
Remark: A similar argument shows that the possible Remark: (by David Savitt and Noam Elkies) Here are
functions g are precisely those of the form f (x, 0) + c two other ways to prove the termination. One is to ob-
for some c. serve that j ajj is strictly increasing at each step, and
Q
A2 Barbara wins using one of the following strategies. bounded above by (a1 · · · an )n . The other is to notice
that a1 is nonincreasing but always positive, so even-
First solution: Pair each entry of the first row with the
tually becomes constant; then a2 is nonincreasing but
entry directly below it in the second row. If Alan ever
always positive, and so on.
writes a number in one of the first two rows, Barbara
writes the same number in the other entry in the pair. If Reinterpretation: For each p, consider the sequence
Alan writes a number anywhere other than the first two consisting of the exponents of p in the prime factoriza-
rows, Barbara does likewise. At the end, the resulting tions of a1 , . . . , an . At each step, we pick two positions
matrix will have two identical rows, so its determinant i and j such that the exponents of some prime p are in
will be zero. the wrong order at positions i and j. We then sort these
Second solution: (by Manjul Bhargava) Whenever two position into the correct order for every prime p si-
Alan writes a number x in an entry in some row, Bar- multaneously.
bara writes −x in some other entry in the same row. At It is clear that this can only terminate with all se-
the end, the resulting matrix will have all rows summing quences being sorted into the correct order. We must
to zero, so it cannot have full rank. still check that the process terminates; however, since
all but finitely many of the exponent sequences consist
A3 We first prove that the process stops. Note first that
of all zeroes, and each step makes a nontrivial switch
the product a1 · · · an remains constant, because aj ak =
in at least one of the other exponent sequences, it is
gcd(aj , ak ) lcm(aj , ak ). Moreover, the last number in
enough to check the case of a single exponent sequence.
the sequence can never decrease, because it is always
This can be done as in the first solution.
replaced by its least common multiple with another
number. Since it is bounded above (by the product of Remark: Abhinav Kumar suggests the following proof
all of the numbers), the last number must eventually that the process always terminates in at most n2 steps.
reach its maximum value, after which it remains con- (This is a variant of the worst-case analysis of the bub-
stant throughout. After this happens, the next-to-last ble sort algorithm.)
number will never decrease, so it eventually becomes Consider the number of pairs (k, l) with 1 ≤ k < l ≤ n
constant, and so on. After finitely many steps, all of the such that ak does not divide al (call these bad pairs). At
numbers will achieve their final values, so no more steps each step, we find one bad pair (i, j) and eliminate it,
will be possible. This only happens when aj divides ak and we do not touch any pairs that do not involve either
for all pairs j < k. i or j. If i < k < j, then neither of the pairs (i, k)
We next check that there is only one possible final and (k, j) can become bad, because ai is replaced by a
sequence. For p a prime and m a nonnegative in- divisor of itself, while aj is replaced by a multiple of
teger, we claim that the number of integers in the itself. If k < i, then (k, i) can only become a bad pair
list divisible by pm never changes. To see this, sup- if ak divided ai but not aj , in which case (k, j) stops
pose we replace aj , ak by gcd(aj , ak ), lcm(aj , ak ). If being bad. Similarly, if k > j, then (i, k) and (j, k)
neither of aj , ak is divisible by pm , then neither of either stay the same or switch status. Hence the number
gcd(aj , ak ), lcm(aj , ak ) is either. If exactly one aj , ak of bad pairs goes down by at least 1 each time; since it
is divisible by pm , then lcm(aj , ak ) is divisible by pm is at most n2 to begin with, this is an upper bound for

but gcd(aj , ak ) is not. the number of steps.
gcd(aj , ak ), lcm(aj , ak ) are as well. Remark: This problem is closely related to the classi-
If we started out with exactly h numbers not divisible fication theorem for finite abelian groups. Namely, if
by pm , then in the final sequence a′1 , . . . , a′n , the num- a1 , . . . , an and a′1 , . . . , a′n are the sequences obtained

www.adultpdf.com
at two different steps in the process, then the abelian of these examples, the initial sequence a, b, c fails to
groups Z/a1 Z×· · ·×Z/an Z and Z/a′1 Z×· · ·×Z/a′n Z determine the final sequence; for the diamond, we can
are isomorphic. The final sequence gives a canonical end up with 0, ∗, 1 for any of ∗ = a, b, c, whereas for the
presentation of this group; the terms of this sequence pentagon we can end up with 0, ∗, 1 for any of ∗ = a, b.
are called the elementary divisors or invariant factors Consequently, the final sequence is determined by the
of the group. initial sequence if and only if L is distributive.
Remark: (by Tom Belulovich) A lattice is a partially
ordered set L in which for any two x, y ∈ L, there is a A4 The sum diverges. From the definition, f (x)e = x on
[1, e], x ln x on (e, ee ], x ln x ln ln x on (ee , ee ], and so
unique minimal element z with z ≥ x and z ≥ y, called
the join and denoted x ∧ y, and there is a unique max- forth. It follows that on [1,P ∞), f is positive, continu-
1
ous, and increasing. Thus ∞ , if it converges,
imal element z with z ≤ x and z ≤ y, called the meet R ∞ dx n=1 f (n)
and denoted x ∨ y. In terms of a lattice L, one can pose is bounded below by 1 f (x) ; it suffices to prove that
the following generalization of the given problem. Start the integral diverges.
with a1 , . . . , an ∈ L. If i < j but ai 6≤ aj , it is per- Write ln1 x = ln x and lnk x = ln(lnk−1 x) for
mitted to replace ai , aj by ai ∨ aj , ai ∧ aj , respectively. k ≥ 2; similarly write exp1 x = ex and expk x =
The same argument as above shows that this always ter- k−1
eexp x . If we write y = lnk x, then x =
minates in at most n2 steps. The question is, under
expk y and dx = (expk y)(expk−1 y) · · · (exp1 y)dy =
what conditions on the lattice L is the final sequence
uniquely determined by the initial sequence? x(ln1 x) · · · (lnk−1 x)dy. Now on [expk−1 1, expk 1],
we have f (x) = x(ln1 x) · · · (lnk−1 x), and thus sub-
It turns out that this holds if and only if L is distributive,
stituting y = lnk x yields
i.e., for any x, y, z ∈ L,
Z expk 1 Z 1
dx
x ∧ (y ∨ z) = (x ∧ y) ∨ (x ∧ z). = dy = 1.
expk−1 1 f (x) 0
(This is equivalent to the same axiom with the oper- R∞ P∞ R expk 1
dx dx
ations interchanged.) For example, if L is a Boolean It follows that 1 f (x) = k=1 expk−1 1 f (x) di-
algebra, i.e., the set of subsets of a given set S under verges, as desired.
inclusion, then ∧ is union, ∨ is intersection, and the dis-
tributive law holds. Conversely, any finite distributive A5 Form the polynomial P (z) = f (z) + ig(z) with com-
lattice is contained in a Boolean algebra by a theorem plex coefficients. It suffices to prove that P has degree
of Birkhoff. The correspondence takes each x ∈ L to at least n − 1, as then one of f, g must have degree at
the set of y ∈ L such that x ≥ y and y cannot be written least n − 1.
as a join of two elements of L \ {y}. (See for instance By replacing P (z) with aP (z) + b for suitable a, b ∈
Birkhoff, Lattice Theory, Amer. Math. Soc., 1967.) C, we can force the regular n-gon to have vertices
On one hand, if L is distributive, it can be shown that ζn , ζn2 , . . . , ζnn for ζn = exp(2πi/n). It thus suffices to
the j-th term of the final sequence is equal to the meet of check that there cannot exist a polynomial P (z) of de-
ai1 ∧· · ·∧aij over all sequences 1 ≤ i1 < · · · < ij ≤ n. gree at most n−2 such that P (i) = ζni for i = 1, . . . , n.
For instance, this can be checked by forming the small- We will prove more generally that for any complex
est subset L′ of L containing a1 , . . . , an and closed un- number t ∈ / {0, 1}, and any integer m ≥ 1, any poly-
der meet and join, then embedding L′ into a Boolean nomial Q(z) for which Q(i) = ti for i = 1, . . . , m has
algebra using Birkhoff’s theorem, then checking the degree at least m − 1. There are several ways to do this.
claim for all Boolean algebras. It can also be checked First solution: If Q(z) has degree d and leading coef-
directly (as suggested by Nghi Nguyen) by showing that ficient c, then R(z) = Q(z + 1) − tQ(z) has degree d
for j = 1, . . . , n, the meet of all joins of j-element sub- and leading coefficient (1 − t)c. However, by hypoth-
sets of a1 , . . . , an is invariant at each step. esis, R(z) has the distinct roots 1, 2, . . . , m − 1, so we
On the other hand, a lattice fails to be distributive if must have d ≥ m − 1.
and only if it contains five elements a, b, c, 0, 1 such that Second solution: We proceed by induction on m. For
either the only relations among them are implied by the base case m = 1, we have Q(1) = t1 6= 0, so Q
must be nonzero, and so its degree is at least 0. Given
1 ≥ a, b, c ≥ 0 the assertion for m − 1, if Q(i) = ti for i = 1, . . . , m,
then the polynomial R(z) = (t−1)−1 (Q(z+1)−Q(z))
(this lattice is sometimes called the diamond), or the has degree one less than that of Q, and satisfies R(i) =
only relations among them are implied by ti for i = 1, . . . , m − 1. Since R must have degree at
least m − 2 by the induction hypothesis, Q must have
1 ≥ a ≥ b ≥ 0, 1≥c≥0
degree at least m − 1.
(this lattice is sometimes called the pentagon). (For a Third solution: We use the method of finite differ-
proof, see the Birkhoff reference given above.) For each ences (as in the second solution) but without induction.

www.adultpdf.com
Namely, the (m − 1)-st finite difference of P evaluated the fraction of elements of G not generated by S) by a
at 1 equals quantity no greater than
m−1
X
m−1
1 − (2m − m2 /n)/n = s2 .
j
(−1) Q(m − j) = t(1 − t)m−1 6= 0,
j=0
j We start out with k = 0 and s = 1 − 1/n; after k steps,
k
we have s ≤ (1 − 1/n)2 . It is enough to prove that for
which is impossible if Q has degree less than m − 1. some c > 0, we can always find an integer k ≤ c ln n
Remark: One can also establish the claim by comput- such that
ing a Vandermonde-type determinant, or by using the 2k
Lagrange interpolation formula to compute the leading 1 1
1− < ,
coefficient of Q. n n
A6 For notational convenience, we will interpret the prob- as then we have n − m < 1 and hence H = G.
lem as allowing the empty subsequence, whose product To obtain this last inequality, put
is the identity element of the group. To solve the prob-
lem in the interpretation where the empty subsequence k = ⌊2 log2 n⌋ < (2/ ln 2) ln n,
is not allowed, simply append the identity element to
so that 2k+1 ≥ n2 . From the facts that ln n ≤ ln 2 +
the sequence given by one of the following solutions.
(n − 2)/2 ≤ n/2 and ln(1 − 1/n) < −1/n for all
First solution: Put n = |G|. We will say that a se- n ≥ 2, we have
quence S produces an element g ∈ G if g occurs as the
n2

product of some subsequence of S. Let H be the set of 1 n
2k ln 1 − <− = − < − ln n,
elements produced by the sequence S. n 2n 2
Start with S equal to the empty sequence. If at any point yielding the desired inequality.
the set H −1 H = {h1 h2 : h−11 , h2 ∈ H} fails to be all
Remark: An alternate approach in the second solution
of G, extend S by appending an element g of G not
is to distinguish betwen the cases of H small (i.e., m <
in H −1 H. Then Hg ∩ H must be empty, otherwise
n1/2 , in which case m can be replaced by a value no
there would be an equation of the form h1 g = h2 with
less than 2m − 1) and H large. This strategy is used in
h1 , h2 ∈ G, or g = h−1 1 h2 , a contradiction. Thus we
a number of recent results of Bourgain, Tao, Helfgott,
can extend S by one element and double the size of H.
and others on small doubling or small tripling of subsets
After k ≤ log2 n steps, we must obtain a sequence of finite groups.
S = a1 , . . . , ak for which H −1 H = G. Then the se-
In the second solution, if we avoid the rather weak in-
quence a−1 −1
k , . . . , a1 , a1 , . . . , ak produces all of G and equality ln n ≤ n/2, we instead get sequences of length
has length at most (2/ ln 2) ln n.
log2 (n ln n) = log2 (n) + log2 (ln n). This is close to
Second solution: optimal: one cannot use fewer than log2 n terms be-
Put m = |H|. We will show that we can append one cause the number of subsequences must be at least n.
element g to S so that the resulting sequence of k + 1
B1 There are at most two such points. For example,
elements will produce at least 2m − m2 /n elements of
the points (0, 0) and (1, 0) lie on a circle with center
G. To see this, we compute
(1/2, x) for any real number x, not necessarily rational.
On the other hand, suppose P = (a, b), Q =
X X
|H ∪ Hg| = (|H| + |Hg| − |H ∩ Hg|)
g∈G g∈G (c, d), R = (e, f ) are three rational points that lie on
X a circle. The midpoint M of the side P Q is ((a +
= 2mn − |H ∩ Hg| c)/2, (b + d)/2), which is again rational. Moreover, the
g∈G slope of the line P Q is (d−b)/(c−a), so the slope of the
= 2mn − |{(g, h) ∈ G2 : h ∈ H ∩ Hg}| line through M perpendicular to P Q is (a − c)/(b − d),
X which is rational or infinite.
= 2mn − |{g ∈ G : h ∈ Hg}|
h∈H
Similarly, if N is the midpoint of QR, then N is a ratio-
X nal point and the line through N perpendicular to QR
= 2mn − |H −1 h| has rational slope. The center of the circle lies on both
h∈H of these lines, so its coordinates (g, h) satisfy two linear
2 equations with rational coefficients, say Ag + Bh = C
= 2mn − m .
and Dg + Eh = F . Moreover, these equations have a
By the pigeonhole principle, we have |H ∪Hg| ≥ 2m− unique solution. That solution must then be
m2 /n for some choice of g, as claimed.
g = (CE − BD)/(AE − BD)
In other words, by extending the sequence by one el-
ement, we can replace the ratio s = 1 − m/n (i.e., h = (AF − BC)/(AE − BD)

www.adultpdf.com
(by elementary algebra, or Cramer’s rule), so the center In geometric terms, the vector (v1i , v2i ) in R2 has
of the circle is rational. This proves the desired result. dot product at most 1 with every unit vector. Since
this holds for the unit vector in the same direction as
Remark: The above solution is deliberately more ver-
(v1i , v2i ), we must have
bose than is really necessary. A shorter way to say this
is that any two distinct rational points determine a ra- 2
v1i 2
+ v2i ≤1 (i = 1, . . . , 4).
tional line (a line of the form ax + by + c = 0 with
a, b, c rational), while any two nonparallel rational lines Conversely, if this holds, then the Cauchy-Schwarz in-
intersect at a rational point. A similar statement holds equality and the above analysis imply that C lies in H.
with the rational numbers replaced by any field.
If r is the radius of C, then
Remark: A more explicit argument is to show that
4 4
the equation of the circle through the rational points X X
2r2 = 2
v1i + 2
v2i
(x1 , y1 ), (x2 , y2 ), (x3 , y3 ) is
i=1 i=1
4
x21 + y12 x1 y1 1
  X
2 2
= (v1i + v2i )
x2 + y22 x2 y2 1
0= det  22 i=1
x3 + y32 x3 y3 1
2
x +y 2
x y 1 ≤ 4,
√
which has the form a(x2 + y 2 ) + dx + ey + f = so r ≤ 2. Since this is achieved by the circle through
0 for a, d, e, f rational. The center of this circle is (1, 1, 0, 0) and (0, 0, 1, 1), it is the desired maximum.
(−d/(2a), −e/(2a)), which is again a rational point. Remark: One may similarly ask for the radius of the
largest k-dimensional ball inside an n-dimensional unit
n
Pnclaim that Fn (x) = (ln x − an )x /n!, where an =
B2 We hypercube; the given problem is the case (n, k) =
k=1 1/k. Indeed, temporarily write Gn (x) = (ln x − (4, 2). Daniel Kane gives the following argument p to
an )xn /n! for x > 0 and n ≥ 1; then limx→0 Gn (x) = show that the maximum radius in this case is 21 nk .
0 and G′n (x) = (ln x − an + 1/n)xn−1 /(n − 1)! = (Thanks for Noam Elkies for passing this along.)
Gn−1 (x), and the claim follows by the Fundamental We again scale up by a factor of 2, so that we are trying
Theorem of Calculus and induction on n. to show that the maximum radius r of a k-dimensional
ball contained in the hypercube [−1, 1]n is nk . Again,
p
Given the claim, we have Fn (1) = −an /n! and so we
need to evaluate − limn→∞ lnann . But sincePthe function there is no loss of generality in centering the ball at the
n
1/x is strictly decreasing for x positive, k=2 1/k = origin. Let T : Rk → Rn be a similitude carrying the
Rn
an − 1 is bounded below by 2 dx/x = ln n − unit ball to this embedded k-ball. Then there exists a
Rn
ln 2 and above by 1 dx/x = ln n. It follows that vector vi ∈ Rk such that for e1 , . . . , en the standard ba-
an
limn→∞ ln n = 1, and the desired limit is −1. sis of Rn , x·vi = T (x)·ei for all x ∈ Rk . The condition
of the problem is equivalent to requiring |vi | ≤ 1 for all
√
i, while the radius r of the embedded ball is determined
B3 The largest possible radius is 22 . It will be convenient
by the fact that for all x ∈ Rk ,
to solve the problem for a hypercube of side length 2
instead, in which√ case we are trying to show that the n
X
largest radius is 2. r2 (x · x) = T (x) · T (x) = x · vi .
i=1
Choose coordinates so that the interior of the hypercube
is the set H = [−1, 1]4 in R4 . Let C be a circle centered Let M be the matrix with columns v1 , . . . , vk ; then
at the point P . Then C is contained both in H and M M T = r2 Ik , for Ik the k × k identity matrix. We
its reflection across P ; these intersect in a rectangular then have
paralellepiped each of whose pairs of opposite faces are
at most 2 unit apart. Consequently, if we translate C so kr2 = Trace(r2 Ik ) = Trace(M M T )
that its center moves to the point O = (0, 0, 0, 0) at the Xn
center of H, then it remains entirely inside H. = Trace(M T M ) = |vi |2
i=1
This means that the answer we seek equals the largest
possible radius of a circle C contained in H and cen- ≤ n,
tered at O. Let v1 = (v11 , . . . , v14 ) and v2 = pn
(v21 , . . . , v24 ) be two points on C lying on radii per- yielding the upper bound r ≤ k.
pendicular to each other. Then the points of the circle To show that this bound is optimal, it is enough to show
can be expressed as v1 cos θ + v2 sin θ for 0 ≤ θ < 2π. that one can find an orthogonal projection of Rn onto
Then C lies in H if and only if for each i, we have Rk so that the projections of the ei all have the same
norm (one can then rescale to get the desired configura-
|v1i cos θ + v2i sin θ| ≤ 1 (0 ≤ θ < 2π). tion of v1 , . . . , vn ). We construct such a configuration

www.adultpdf.com
by a “smoothing” argument. Startw with any projec- is an integer by the property of f . Since f is differen-
tion. Let w1 , . . . , wn be the projections of e1 , . . . , en . tiable at a/b, the left hand side has a limit. It follows
If the desired condition is not achieved, we can choose that for sufficiently large n, both sides must be equal to
i, j such that some integer c = f ′ ( ab ): f ( an+1 a c
bn ) = f ( b ) + bn . Now
c cannot be 0, since otherwise f ( bn ) = f ( ab ) for
an+1
1
|wi |2 < (|w1 |2 + · · · + |wn |2 ) < |wj |2 . sufficiently large n has denominator b rather than bn.
n Similarly, |c| cannot be greater than 1: otherwise if we
By precomposing with a suitable rotation that fixes eh take n = k|c| for k a sufficiently large positive integer,
for h 6= i, j, we can vary |wi |, |wj | without varying then f ( ab ) + bn
c
has denominator bk, contradicting the
an+1
|wi |2 + |wj |2 or |wh | for h 6= i, j. We can thus choose fact that f ( bn ) has denominator bn. It follows that
such a rotation to force one of |wi |2 , |wj |2 to become c = f ′ ( ab ) = ±1.
equal to n1 (|w1 |2 + · · · + |wn |2 ). Repeating at most Thus the derivative of f at any rational number is ±1.
n − 1 times gives the desired configuration. Since f is continuously differentiable, we conclude that
B4 We use the identity given by Taylor’s theorem: f ′ (x) = 1 for all real x or f ′ (x) = −1 for all real x.
Since f (0) must be an integer (a rational number with
deg(h)
X h(i) (x) denominator 1), f (x) = x + n or f (x) = −x + n for
h(x + y) = yi. some integer n.
i=0
i!
Remark: After showing that f ′ (q) is an integer for
each q, one can instead argue that f ′ is a continuous
In this expression, h(i) (x)/i! is a polynomial in x with
function from the rationals to the integers, so must be
integer coefficients, so its value at an integer x is an
constant. One can then write f (x) = ax + b and check
integer.
that b ∈ Z by evaluation at a = 0, and that a = ±1 by
For x = 0, . . . , p − 1, we deduce that evaluation at x = 1/a.
h(x + p) ≡ h(x) + ph′ (x) (mod p2 ). B6 In all solutions, let Fn,k be the number of k-limited per-
mutations of {1, . . . , n}.
(This can also be deduced more directly using the bino-
mial theorem.) Since we assumed h(x) and h(x + p) First solution: (by Jacob Tsimerman) Note that any
are distinct modulo p2 , we conclude that h′ (x) 6≡ 0 permutation is k-limited if and only if its inverse is k-
(mod p). Since h′ is a polynomial with integer coeffi- limited. Consequently, the number of k-limited per-
cients, we have h′ (x) ≡ h′ (x + mp) (mod p) for any mutations of {1, . . . , n} is the same as the number of
integer m, and so h′ (x) 6≡ 0 (mod p) for all integers k-limited involutions (permutations equal to their in-
x. verses) of {1, . . . , n}.
Now for x = 0, . . . , p2 − 1 and y = 0, . . . , p − 1, we We use the following fact several times: the number
write of involutions of {1, . . . , n} is odd if n = 0, 1 and
even otherwise. This follows from the fact that non-
h(x + yp2 ) ≡ h(x) + p2 yh′ (x) (mod p3 ). involutions come in pairs, so the number of involu-
tions has the same parity as the number of permutations,
Thus h(x), h(x + p2 ), . . . , h(x + (p − 1)p2 ) run over namely n!.
all of the residue classes modulo p3 congruent to
h(x) modulo p2 . Since the h(x) themselves cover For n ≤ k + 1, all involutions are k-limited. By the
all the residue classes modulo p2 , this proves that previous paragraph, Fn,k is odd for n = 0, 1 and even
h(0), . . . , h(p3 − 1) are distinct modulo p3 . for n = 2, . . . , k + 1.
Remark: More generally, the same proof shows that For n > k + 1, group the k-limited involutions into
for any integers d, e > 1, h permutes the residue classes classes based on their actions on k + 2, . . . , n. Note
modulo pd if and only if it permutes the residue classes that for C a class and σ ∈ C, the set of elements of
modulo pe . The argument used in the proof is related A = {1, . . . , k + 1} which map into A under σ de-
to a general result in number theory known as Hensel’s pends only on C, not on σ. Call this set S(C); then the
lemma. size of C is exactly the number of involutions of S(C).
Consequently, |C| is even unless S(C) has at most one
B5 The functions f (x) = x+n and f (x) = −x+n for any element. However, the element 1 cannot map out of A
integer n clearly satisfy the condition of the problem; because we are looking at k-limited involutions. Hence
we claim that these are the only possible f . if S(C) has one element and σ ∈ C, we must have
Let q = a/b be any rational number with gcd(a, b) = 1 σ(1) = 1. Since σ is k-limited and σ(2) cannot belong
and b > 0. For n any positive integer, we have to A, we must have σ(2) = k + 2. By induction, for
i = 3, . . . , k + 1, we must have σ(i) = k + i.
f ( an+1 a
bn ) − f ( b )

an + 1 a
If n < 2k + 1, this shows that no class C of odd cardi-
1 = bnf − nbf
bn
bn b nality can exist, so Fn,k must be even. If n ≥ 2k + 1,

www.adultpdf.com
the classes of odd cardinality are in bijection with k- We next add column 1 to each of columns 2, . . . , k + 1.
limited involutions of {2k + 2, . . . , n}, so Fn,k has the  
same parity as Fn−2k−1,k . By induction on n, we de- 1 0 0 0 0 0 0 ∅
duce the desired result. 0 0 0 0 1 0 0 ∅
 
0 0 0 0 1 1 0 ∅
 
Second solution: (by Yufei Zhao) Let Mn,k be the n ×  
n matrix with 0 0 0 0 1 1 1 ∅
 
( 0 1 1 1 1 1 1 ?
1 |i − j| ≤ k  
(Mn,k )ij = 0 0 1 1 1 1 1 ?
 
0 otherwise.  
0 0 0 1 1 1 1 ?
Write det(Mn,k ) as the sum over permutations σ of ∅ ∅ ∅ ∅ ? ? ? ∗
{1, . . . , n} of (Mn,k )1σ(1) · · · (Mn,k )nσ(n) times the
signature of σ. Then σ contributes ±1 to det(Mn,k ) For i = 2, for each of j = i + 1, . . . , 2k + 1 for which
if σ is k-limited and 0 otherwise. We conclude that the (j, k + i)-entry is nonzero, add row i to row j.
 
det(Mn,k ) ≡ Fn,k (mod 2). 1 0 0 0 0 0 0 ∅
0 0 0 0 1 0 0 ∅
 
For the rest of the solution, we interpret Mn,k as a ma- 0 0 0 0 0 1 0 ∅
 
trix over the field of two elements. We compute its de- 
0 0 0 0 0 1 1 ∅

terminant using linear algebra modulo 2.  
0 1 1 1 0 1 1 ?
We first show that for n ≥ 2k + 1,  
0 0 1 1 0 1 1 ?
 
Fn,k ≡ Fn−2k−1,k (mod 2),
 
0 0 0 1 0 1 1 ?
provided that we interpret F0,k = 1. We do this by com- ∅ ∅ ∅ ∅ ∅ ? ? ∗
puting det(Mn,k ) using row and column operations. Repeat the previous step for i = 3, . . . , k + 1 in succes-
We will verbally describe these operations for general sion.
k, while illustrating with the example k = 3.  
To begin with, Mn,k has the following form. 1 0 0 0 0 0 0 ∅
0 0 0 0 1 0 0 ∅
 
1 1 1 1 0 0 0 ∅
 
0 0 0 0 0 1 0 ∅
 
1 1 1 1 1 0 0 ∅ 
0 0 0 0 0 0 1 ∅

1 1 1 1 1 1 0 ∅  

1 1 1 1 1 1 1 ∅
 0 1 1 1 0 0 0 ?
   
0 0 1 1 0 0 0 ?
0 1 1 1 1 1 1 ?  
 
0 0 1 1 1 1 1 ? 
0 0 0 1 0 0 0 ?

 
0 0 0 1 1 1 1 ?
∅ ∅ ∅ ∅ ∅ ∅ ∅ ∗
∅ ∅ ∅ ∅ ? ? ? ∗
Repeat the two previous steps with the roles of the rows
In this presentation, the first 2k + 1 rows and columns and columns reversed. That is, for i = 2, . . . , k + 1, for
are shown explicitly; the remaining rows and columns each of j = i + 1, . . . , 2k + 1 for which the (j, k + i)-
are shown in a compressed format. The symbol ∅ in- entry is nonzero, add row i to row j.
dicates that the unseen entries are all zeroes, while the  
symbol ? indicates that they are not. The symbol ∗ in 1 0 0 0 0 0 0 ∅
the lower right corner represents the matrix Fn−2k−1,k . 0 0 0 0 1 0 0 ∅
 
We will preserve the unseen structure of the matrix by 0 0 0 0 0 1 0 ∅
 
only adding the first k + 1 rows or columns to any of 
0 0 0 0 0 0 1 ∅

the others. 
0 1 0 0 0 0 0 ∅

 
We first add row 1 to each of rows 2, . . . , k + 1. 0 0 1 0 0 0 0 ∅
 
0 0 0 1 0 0 0 ∅
   
1 1 1 1 0 0 0 ∅
0 0 0 0 1 0 0 ∅
  ∅ ∅ ∅ ∅ ∅ ∅ ∅ ∗
0 0 0 0 1 1 0 ∅
 
  We now have a block diagonal matrix in which the top
0 0 0 0 1 1 1 ∅ left block is a (2k + 1) × (2k + 1) matrix with nonzero
 
0 1 1 1 1 1 1 ?
  determinant (it results from reordering the rows of the
0 0 1 1 1 1 1 ?
  identity matrix), the bottom right block is Mn−2k−1,k ,

0 0 0 1 1 1 1 ?
 and the other two blocks are zero. We conclude that
∅ ∅ ∅ ∅ ? ? ? ∗ det(Mn,k ) ≡ det(Mn−2k−1,k ) (mod 2),

www.adultpdf.com
proving the desired congruence. such that a1 r1 + · · · + an rn is the zero vector. The m-
To prove the desired result, we must now check that th coordinate of this vector equals am−k + · · · + am+k ,
F0,k , F1,k are odd and F2,k , . . . , F2k,k are even. For where we regard ai as zero if i ∈ / {1, . . . , n}. By com-
n = 0, . . . , k + 1, the matrix Mn,k consists of all ones, paring consecutive coordinates, we obtain
so its determinant is 1 if n = 0, 1 and 0 otherwise. (Al-
ternatively, we have Fn,k = n! for n = 0, . . . , k + 1, am−k = am+k+1 (1 ≤ m < n).
since every permutation of {1, . . . , n} is k-limited.) For
n = k + 2, . . . , 2k, observe that rows k and k + 1 of In particular, the ai repeat with period 2k + 1. Taking
Mn,k both consist of all ones, so det(Mn,k ) = 0 as m = 1, . . . , k further yields that
desired.
ak+2 = · · · = a2k+1 = 0
Third solution: (by Tom Belulovich) Define Mn,k as
in the second solution. We prove det(Mn,k ) is odd for while taking m = n − k, . . . , n − 1 yields
n ≡ 0, 1 (mod 2k + 1) and even otherwise, by directly
determining whether or not Mn,k is invertible as a ma- an−2k = · · · = an−1−k = 0.
trix over the field of two elements.
Let ri denote row i of Mn,k . We first check that if n ≡ For n ≡ 0 (mod 2k + 1), the latter can be rewritten as
2, . . . , 2k (mod 2k + 1), then Mn,k is not invertible.
In this case, we can find integers 0 ≤ a < b ≤ k such a1 = · · · = ak = 0
that n + a + b ≡ 0 (mod 2k + 1). Put j = (n + a +
b)/(2k + 1). We can then write the all-ones vector both whereas for n ≡ 1 (mod 2k + 1), it can be rewritten as
as
j−1
a2 = · · · = ak+1 = 0.
X
rk+1−a+(2k+1)i
In either case, since we also have
i=0
and as a1 + · · · + a2k+1 = 0
from the (k + 1)-st coordinate, we deduce that all of the
j−1
X ai must be zero, and so Mn,k must be invertible.
rk+1−b+(2k+1)i .
i=0 Remark: The matrices Mn,k are examples of banded
matrices, which occur frequently in numerical appli-
Hence Mn,k is not invertible. cations of linear algebra. They are also examples of
We next check that if n ≡ 0, 1 (mod 2k + 1), then Toeplitz matrices.
Mn,k is invertible. Suppose that a1 , . . . , an are scalars

www.adultpdf.com

The 62nd William Lowell Putnam Mathematical Competition Saturday, December 1, 2001

Uploaded by

Document Information

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

The 62nd William Lowell Putnam Mathematical Competition Saturday, December 1, 2001

Uploaded by

Copyright:

Available Formats

The 62nd William Lowell Putnam Mathematical Competition

Saturday, December 1, 2001

ased so that, when tossed, it has probability "#$ &%'()"

This is trial version

converge? B6 Let p be a prime number. Prove that the determinant of

This is trial version

A1 Let be a fixed positive integer. How many ways are

'   " #( *)"#  ' % %   % #( *)"#

and continue until 6 the

A4 Suppose that @ % AB"CD"EF"G are real numbers, IK H J

dips below the -axis. A return is a maximal sequence

B5 Let CDE , and G be equidistant points on the circumfer-

V ZX S V [ H V V \ V ]^   0  'b6 (   'ac ( 0 d 6 d c  0  'b6 ( 0 d 6 !

This is trial version

A3 Define a sequence {un }∞ n=0 by u0 = u1 = u2 = 1, and

is a sequence of squares, all of the same color, starting Y 1 + xn+1

This is trial version

This is trial version

This is trial version

This is trial version

This is trial version

Manjul Bhargava, Kiran Kedlaya, and Lenny Ng

This is trial version

This is trial version 2

This is trial version 3

This is trial version 4

Kiran Kedlaya and Lenny Ng

This is trial version

This is trial version

This is trial version

since there is a palindrome in each interval [kb, (k + ≡ xy p z p + yz p xp + zxp y p

This is trial version

Manjul Bhargava, Kiran Kedlaya, and Lenny Ng

This is trial version

This is trial version

This is trial version

n−1 and it suffices to show that the sum onP

This is trial version

This is trial version

This is trial version

This is trial version

This is trial version

This is trial version

mn − A + B. Hence adding the i-th square increases the expected

This is trial version

This is trial version

by the symmetry in how the Ri are defined. Hence = 2 ln 2 − 1,

This is trial version

This is trial version

A1 We proceed by induction, with base case 1 = 20 30 . segment joining (n − 1, 3) to (n − 1, 2) results in a path

This is trial version

This is trial version

u)/(1 + u) to obtain is an alternating series whose terms strictly decrease to

This is trial version

This is trial version

k-tuple of positive integers with sum ≤ m. There are 1 1

f (m, n) = Qm ∇2 R + (2mn + 4md)Qm−1 R.

This is trial version

In particular, the Qj H d−2j lie in distinct eigenspaces,

This is trial version

X σ(π) (−1)n+1 n!(x + n − 1)

This is trial version

We change to cylindrical coordinates, i.e., we put r =

This is trial version

ased so that, when tossed, it has probability "#$ &%'()"

' " #( )"# ' % % % #( )"#

A4 Suppose that @ % AB"CD"EF"G are real numbers, IK H J

B5 Let CDE , and G be equidistant points on the circumfer-

V ZX S V [ H V V \ V ]^ 0 'b6 ( 'ac ( 0 d 6 d c 0 'b6 ( 0 d 6 !