PPPPPP Research

Personal Public Proof Problem Proposal Potpourri
Ankan Bhattacharya
November 5, 2022
§0 Introduction
This is a list of various olympiad problems I’ve composed. Problems which I consider my best are
denoted with a star (⋆).
In general, problems in each section are ordered by the date they were released to the public, with
exceptions for problems on contests (whose release dates are considered to be the contest date, even
if problems remained confidential afterwards). The problems are not sorted by perceived difficulty
because I didn’t want the problem numbers to change every update.
Some of the problems feature commentary which might contain spoilers. These commentaries are
included in OCGs (optional content groups). Each of these commentaries can be viewed by clicking
on the corresponding link.
However, not all PDF viewers support OCGs. To test if yours does, try toggling the following
content group. Exactly one monospace line of text should be visible at any time.
This line of text can be toggled on and off by clicking the below link.
Toggle the lines of text which are above and below this one.
As a last resort, if your PDF viewer does not support OCGs, you can still copy the text to your
clipboard, enabling you to read it. This is not the intended experience, though.
1
Ankan Bhattacharya (November 5, 2022) Personal Public Proof Problem Proposal Potpourri
§1 Algebra
Problem 1.1. We say that a function f : Z≥0 × Z≥0 → Z is great if for any nonnegative integers m
and n,
f (m + 1, n + 1)f (m, n) − f (m + 1, n)f (m, n + 1) = 1.
If A = (a0 , a1 , . . . ) and B = (b0 , b1 , . . . ) are two sequences of integers, we write A ∼ B if there
exists a great function f satisfying f (n, 0) = an and f (0, n) = bn for every nonnegative integer n (in
particular, this requires a0 = b0 ).
Prove that if A, B, C, and D are four sequences of integers satisfying A ∼ B, B ∼ C, and C ∼ D,
then D ∼ A.
USA TST for IMO 2019, problem 4. A simpler variant was used as USA TST for EGMO 2019,
problem 4.
Toggle commentary for problem 1.1.
Problem 1.2 (⋆). Find all pairs of integers (a, b) for which there exist functions f : Z → Z and
g : Z → Z satisfying
f (g(x)) = x + a and g(f (x)) = x + b
for all integers x.
JMO 2019, problem 2.
Problem 1.3. Let n ≥ 2 be an integer. Let P (x1 , x2 , . . . , xn ) be a nonconstant n-variable polynomial

with real coefficients. Assume that whenever r1 , r2 , . . . , rn are real numbers, at least two of which
are equal, we have P (r1 , r2 , . . . , rn ) = 0. Prove that P (x1 , x2 , . . . , xn ) cannot be written as the sum
of fewer than n! monomials.
JMO 2020, problem 6. Follows from the Minkowski sum property of Newton polytopes. I believe
this is my earliest created problem statement, as I created it while still in high school (though I
only solved the problem much later).
Problem 1.4 (⋆). Find all nonconstant polynomials P (z) with complex coefficients for which all
complex roots of the polynomials P (z) and P (z) − 1 have absolute value 1.
2
USA TSTST 2020, problem 7. This is the problem that appeared on the exam; the original I
submitted asked to find all monic polynomial pairs (A, B) with no double roots, all roots on the
unit circle, and A − B a nonzero constant. Except for the double root restriction, the two problems
are essentially equivalent.
Problem 1.5. Let a0 , b0 , c0 be complex numbers, and define

an+1 = a2n + 2bn cn
bn+1 = b2n + 2cn an
cn+1 = c2n + 2an bn
for all nonnegative integers n.
Suppose that max{|an |, |bn |, |cn |} ≤ 2022 for all n. Prove that
|a0 |2 + |b0 |2 + |c0 |2 ≤ 1.
Problem 1.6 (⋆). Find all functions f : R → R satisfying

f (a) − f (b) f (b) − f (c) f (c) − f (a) = f ab2 + bc2 + ca2 ) − f (a2 b + b2 c + c2 a)

for all real a, b, c.

IMO shortlist 2021, problem A8. Unfortunately, my praise of the problem somehow turned into a
meme, which has severely tainted my fondness for the problem. I’m still really proud of it, though,
and I think it’s one of my best works.
3
§2 Combinatorics
Problem 2.1. Let n be a fixed positive integer. We choose positive integers t1 , . . . , tn (not
P distinct) and for each integer r, we let ar denote the number of subsets I ⊆ {1, . .P
necessarily . , n} for
which i∈I ti = r (this includes I = ∅ when r = 0). Find the maximum possible value of r∈Z a2r
over all choices of (t1 , . . . , tn ).
PRIMES entrance exam 2019, problem M4(b). In the exam, a part (a) was added by the
organizers, asking for the minimum possible value of the sum.
Problem 2.2. Let S be a set of 16 points in the plane, no three collinear. Let χ(S) denote the
number of ways to draw 8 line segments with endpoints in S, such that no two drawn segments
intersect, even at endpoints. Find the smallest possible value of χ(S) across all such S.
USA TSTST 2019, problem 8.

Problem 2.3. Let P be a finite set of squares on an infinite chessboard. Kelvin the Frog notes
that P may be tiled with only 1 × 2 dominoes, while Alex the Kat notes that P may be tiled with
only 2 × 1 dominoes. The dominoes cannot be rotated in each tiling. Prove that the area of P is a
multiple of 4.
USMCA national finals 2020, Premier division, problem 1. Anticipated by OMO Fall 2019,
problem 20.
Problem 2.4 (⋆). Let P be a regular polygon, and let V be its set of vertices. Each point in V is
colored red, white, or blue. A subset of V is patriotic if it contains an equal number of points of
each color, and a side of P is dazzling if its endpoints are of different colors.
Suppose that V is patriotic and the number of dazzling edges of P is even. Prove that there exists
a line, not passing through any point in V, dividing V into two nonempty patriotic subsets.
USEMO 2019, problem 5. I don’t actually consider this problem to be one of my best; this is
starred because of its overwhelmingly positive reception.
4
Problem 2.5. Let m and n be positive integers. Find the smallest positive integer s for which
there exists an m × n rectangular array of positive integers such that
• each row contains n distinct consecutive integers in some order,
• each column contains m distinct consecutive integers in some order, and
• each entry is less than or equal to s.
ELMO 2020, problem 5. Equivalently: what is the least s such that Km,n is interval s-colorable?
The answer to this problem is known in literature.
Problem 2.6. Let a, b, c be fixed positive integers. There are a + b + c ducks sitting in a circle,
one behind the other. Each duck picks either rock, paper, or scissors, with a ducks picking rock, b
ducks picking paper, and c ducks picking scissors. A move consists of an operation of one of the
following three forms:
• If a duck picking rock sits behind a duck picking scissors, they switch places.
• If a duck picking paper sits behind a duck picking rock, they switch places.
• If a duck picking scissors sits behind a duck picking paper, they switch places.
Determine, in terms of a, b, and c, the maximum number of moves which could take place, over all
possible initial configurations.

Problem 2.7 (⋆). Let a and b be positive integers. The cells of an (a + b + 1) × (a + b + 1) grid are
colored amber and bronze such that there are at least a2 + ab − b amber cells and at least b2 + ab − a
bronze cells. Prove that it is possible to choose a amber cells and b bronze cells such that no two of
the a + b chosen cells lie in the same row or column.
5
USAMO 2022, problem 1 and JMO 2022, problem 2. Despite the problem’s generic-looking
“coloring grid combinatorics” appearance, I’m quite pleased with it.
Problem 2.8. For all positive integers n, k, let f (n, 2k) be the number of ways an n × 2k board
can be fully covered by nk dominoes of size 2 × 1. (For example, f (2, 2) = 2 and f (3, 2) = 3.) Find
all positive integers n such that for every positive integer k, the number f (n, 2k) is odd.
EGMO 2022, problem 5. Not the most original problem: in fact, it is possible to compute the
parity number of domino tilings of an m × n grid for any m and n.
6
§3 Geometry
Problem 3.1. Let ABC be an acute triangle with circumcircle ω, and let H be the foot of the
altitude from A to BC. Let P and Q be the points on ω with P A = P H and QA = QH. The
tangent to ω at P intersects lines AC and AB at E1 and F1 respectively; the tangent to ω at Q
intersects lines AC and AB at E2 and F2 respectively. Show that the circumcircles of △AE1 F1 and
△AE2 F2 are congruent, and the line through their centers is parallel to the tangent to ω at A.
USA TSTST 2018, problem 5. Co-authored with Evan Chen.
Problem 3.2. Let ABC be a triangle with incenter I, and let D be a point on line BC satisfying
∠AID = 90◦ . Let the excircle of triangle ABC opposite the vertex A be tangent to BC at A1 . Define
points B1 on CA and C1 on AB analogously, using the excircles opposite B and C, respectively.
Prove that if quadrilateral AB1 A1 C1 is cyclic, then AD is tangent to the circumcircle of △DB1 C1 .
USA TST for IMO 2019, problem 6. A simpler variant was used as USA TST for EGMO 2019,
problem 5.
Problem 3.3. Let ABCD be a cyclic quadrilateral satisfying AD2 + BC 2 = AB 2 . The diagonals
of ABCD intersect at E. Let P be a point on side AB satisfying ∠AP D = ∠BP C. Show that line
P E bisects CD.
USAMO 2019, problem 2 and JMO 2019, problem 3. A converse is true: if ABCD is cyclic, its
diagonals intersect at E, and there exists a point P on AB such that ∠AP D = ∠BP C and P E
bisects CD, then AD = BC or AD2 + BC 2 = AB 2 .
Problem 3.4. Let ABC be a triangle with ∠B obtuse. Let E, F be the feet of the altitudes from
B and C to lines AC and AB, respectively. Can line EF be tangent to the A-excircle of △ABC?
JMO 2019, problem 4. Co-authored with Zack Chroman and Anant Mudgal.
7
Problem 3.5. Let ABC be a scalene triangle. The incircle of ABC touches BC at D. Let P be a
point on BC satisfying ∠BAP = ∠CAP , and M be the midpoint of BC. Define Q to be on AM
such that P Q ⊥ AM . Prove that the circumcircle of △AQD is tangent to BC.
USMCA national finals 2019, Premier division, problem 3.
Problem 3.6. Let AXBY be a convex quadrilateral satisfying ∠AXB = ∠AY B. The incircle of
△AXY has center IA and touches AX and AY at A1 and A2 respectively. The incircle of △BXY
has center IB and touches BX and BY at B1 and B2 respectively.
Define P = XIA ∩ Y IB , Q = XIB ∩ Y IA , and R = A1 B1 ∩ A2 B2 . Prove that P , Q, R are
collinear.
USMCA national finals 2019, Premier division, problem 7(a). Co-authored with Kevin Ren. In
the exam, a part (b) was added, solely authored by Kevin, which asked to prove that P , Q, and R
are also collinear when AXBY is circumscribed (and ∠AXB = ∠AY B is relaxed).
Problem 3.7 (⋆). Let ABC be a triangle with incenter I. Points K and L are chosen on segment
BC such that the incircles of △ABK and △ABL are tangent at P , and the incircles of △ACK
and △ACL are tangent at Q. Prove that IP = IQ.
USA TSTST 2019, problem 9. One of my favorite compositions. I love how “wrong” the statement
feels: why are the incircles of △ABK and △ABL tangent to each other? That doesn’t sound very
normal.
Problem 3.8. Let P and Q be isogonal conjugates inside triangle ABC. Let ω be the circumcircle
of ABC. Let A1 be a point on arc BC of ω satisfying ∠BA1 P = ∠CA1 Q. Points B1 and C1 are
defined similarly. Prove that lines AA1 , BB1 , CC1 are concurrent.
Sharygin olympiad 2019, final round, grade 10, problem 3.
Problem 3.9. Let ABC be a triangle. Distinct points D, E, F lie on sides BC, AC, and AB,
respectively, such that quadrilaterals ABDE and ACDF are cyclic. Line AD meets the circumcircle
of △ABC again at P . Let Q denote the reflection of P across BC. Show that Q lies on the
circumcircle of △AEF .
USA TST for EGMO 2020, problem 4.
Problem 3.10. Let ABCD be a convex quadrilateral, and let ωA and ωB be the incircles of △ACD
and △BCD, with centers I and J. The second common external tangent to ωA and ωB touches ωA
at K and ωB at L. Prove that lines AK, BL, IJ are concurrent.
8
USMCA national finals 2020, Premier division, problem 7.
Problem 3.11. Let ABC be an acute scalene triangle with circumcenter O and altitudes AD, BE,
CF . Let X, Y , Z be the midpoints of AD, BE, CF . Lines AD and Y Z intersect at P , lines BE
and ZX intersect at Q, and lines CF and XY intersect at R.
Suppose that lines Y Z and BC intersect at A′ , and lines QR and EF intersect at D′ . Prove that
the perpendiculars from A, B, C, O, to the lines QR, RP , P Q, A′ D′ , respectively, are concurrent.
USEMO 2019, problem 6. The following commentary is intentionally not hidden, since I think at
least the first sentence should be seen before trying the problem.
This problem is badly cooked: the conclusion remains true if the points X, Y , Z are
relaxed to any points on the altitudes, and there is an unintended solution which bypasses
the entirety of the intended solving process.
While I am not typically this adamant about stamping out unintended solutions, I do
like to ensure that my problems provide a positive experience. I believe that executing
the unintended solution does not provide such an experience. On the other hand, solvers
following this unintended solution may disagree, but I feel that part of their positive
reaction would be more “I just cheesed this problem 6” and not “Wow, that was cool!”
I wish this flaw had been pointed out in review: then I would have retracted the problem.
I had the thought of checking with GeoGebra whether the problem was cooked in this
way, but decided not to: I selfishly assumed that if I had the thought, then so would one
of the other reviewers, and they would check for themselves. Overall, this is probably
one of my biggest regrets in problem proposing.
For what it’s worth, I do think the intended solution to the problem is nice, and worth
seeing even if one is not interested in trying the problem. Fortunately, at least one
contestant found the intended solution, so I was able to reach out to someone!
Problem 3.12. A quadrilateral ABCD is circumscribed about a circle with center I. A point
P ̸= I is chosen inside ABCD so that the triangles P AB, P BC, P CD, and P DA have equal
perimeters. A circle Γ centered at P meets the rays P A, P B, P C, and P D at A1 , B1 , C1 , and D1 ,
respectively. Prove that the lines P I, A1 C1 , and B1 D1 are concurrent.
RMM extras list 2019, problem G6.

9
Problem 3.13. The sides of a convex 200-gon A1 A2 . . . A200 are colored red and blue in an
alternating fashion. Suppose the extensions of the red sides determine a regular 100-gon, as do the
extensions of the blue sides.
Prove that the 50 diagonals A1 A101 , A3 A103 , . . . , A99 A199 are concurrent.
USEMO 2020, problem 5. Compare with EGMO 2020, problem 3.

Problem 3.14. Rectangles BCC1 B2 , CAA1 C2 , and ABB1 A2 are erected outside an acute triangle
ABC. Suppose that
∠BC1 C + ∠CA1 A + ∠AB1 B = 180◦ .
Prove that lines B1 C2 , C1 A2 , and A1 B2 are concurrent.
USAMO 2021, problem 1 and JMO 2021, problem 2. I believe several special cases are folklore.
Problem 3.15 (⋆). Let ABCDEF be a convex hexagon satisfying AB ∥ DE, BC ∥ EF , CD ∥ F A,

and
AB · DE = BC · EF = CD · F A.
Let X, Y , and Z be the midpoints of AD, BE, and CF . Prove that the circumcenter of △ACE,
the circumcenter of △BDF , and the orthocenter of △XY Z are collinear.
USAMO 2021, problem 6.

Problem 3.16 (⋆). Let n be a positive integer. The kingdom of Zoomtopia is a convex polygon with
integer sides, perimeter 6n, and 60◦ rotational symmetry. In light of the pandemic, the government
of Zoomtopia would like to relocate its 3n2 + 3n + 1 citizens at 3n2 + 3n + 1 points in the kingdom
so that every two citizens have a distance of at least 1 for proper social distancing. Prove that this
is possible. (The kingdom is assumed to contain its boundary.)
10
RMM 2021, problem 5.

Problem 3.17 (⋆). Let A1 C2 B1 A2 C1 B2 be an equilateral hexagon. Let O1 and H1 be the

circumcenter and orthocenter of △A1 B1 C1 , and let O2 and H2 be the circumcenter and orthocenter
of △A2 B2 C2 .
Assume that O1 ̸= O2 and H1 ̸= H2 . Prove that lines O1 O2 and H1 H2 are parallel (or coincide).
USEMO 2021, problem 3. The best problem I’ve ever made. (At the time of writing—though
now IMO 2022, problem 3 is a serious contender.) I still can’t believe it exists.
This problem marked my soft-retirement from constructing olympiad problems: with this problem
published, I decided to devote less time to actively constructing olympiad problems.
Problem 3.18. Let A1 A2 A3 A4 A5 be a convex pentagon satisfying Ai−1 Ai+1 ∥ Ai−2 Ai+2 for all i,
where all indices are considered modulo 5. Prove that there exist points B1 , B2 , B3 , B4 , B5 in the
plane such that
• Bi , Ai−2 , Ai+2 are collinear for all i,
• the five lengths Ai Bi are equal, and
• the five lines Ai Bi are concurrent.
CAMO 2022, problem 6. It’s a really big stretch to call this one mine: I had seen an essentially
identical problem for triangles, and decided to adapt it for pentagons, as I believed the sufficient
conditions presented in this problem were quite surprising.
In fact, I considered not including the problem at all for this reason, but I decided to err on the
side of completeness.
Problem 3.19 (⋆). Let b ≥ 2 and w ≥ 2 be fixed integers, and set n = b + w. Given are 2b identical
black rods and 2w identical white rods, each of side length 1.
We assemble a regular 2n-gon using these rods so that parallel sides are the same color. Then,
a convex 2b-gon B is formed by translating the black rods, and a convex 2w-gon W is formed by
translating the white rods.
Prove that the difference of the areas of B and W depends only on the numbers b and w, and not
on how the 2n-gon was assembled.
11
USAMO 2022, problem 2, and JMO 2022, problem 3.

Problem 3.20. Let ABCD be a rhombus, and let K and L be points such that K lies inside the
rhombus, L lies outside the rhombus, and KA = KB = LC = LD. Prove that there exist points X
and Y on lines AC and BD such that KXLY is also a rhombus.

Problem 3.21 (⋆). Let n ≥ 2 be an integer, and let S be a unit n × n square lattice. Several
polygons are drawn, with vertices in S, such that each point in S is a vertex of at most one drawn
polygon. What is the largest possible sum of the areas of all drawn polygons?
IMO shortlist 2021, problem G3. Co-authored with Michael Ren. Two versions of the problem
appeared in the shortlist packet: the version presented here is a different version—the one I consider
most natural.
12
§4 Number Theory
Problem 4.1. Let p be a prime, and let a1 , . . . , ap be integers. Show that there exists an integer
k such that the numbers
a1 + k, a2 + 2k, . . . , ap + pk
produce at least 12 p distinct remainders upon division by p.
USAMO 2018, problem 4 and JMO 2018, problem 5. This is my first published problem!
Problem 4.2. Determine all nonempty finite sets of positive integers {a1 , . . . , an } such that a1 · · · an
divides (x + a1 ) · · · (x + an ) for every positive integer x.
ELMO SL 2018, problem N1. Anticipated by Putnam 1982, problem B4.
Problem 4.3. Let f : Z → {1, 2, . . . , 10100 } be a function satisfying
gcd(f (x), f (y)) = gcd(f (x), x − y)
for all integers x and y. Show that there exist positive integers m and n such that f (x) = gcd(m+x, n)
for all x.

Problem 4.4. Suppose that (a1 , b1 ), . . . , (a100 , b100 ) are distinct ordered pairs of nonnegative
integers. Let N denote the number of pairs of integers (i, j) satisfying 1 ≤ i < j ≤ 100 and
|ai bj − aj bi | = 1. Determine the largest possible value of N over all possible choices of the 100
ordered pairs.
USAMO 2020, problem 4 and JMO 2020, problem 5.

Problem 4.5 (⋆). For every positive integer N , let σ(N ) denote the sum of the positive integer
divisors of N . Find all integers m ≥ n ≥ 2 satisfying
σ(m) − 1 σ(n) − 1 σ(mn) − 1

= = .
m−1 n−1 mn − 1
13
USA TSTST 2020, problem 8. The original I submitted asked to find all possible values of the
common ratio, given that all three are equal.
Problem 4.6. Find all integers s ≥ 4 for which there exist positive integers a, b, c, d such that
s = a + b + c + d and s divides abc + abd + acd + bcd.
USA February TST for IMO 2021, problem 1. Co-authored with Michael Ren.
Problem 4.7. Find all integers n ≥ 1 such that 2n − 1 has exactly n positive integer divisors.
USEMO 2021, problem 2.
Problem 4.8 (⋆). Let k be a positive integer and let S be a finite set of odd prime numbers. Prove
that there is at most one way (up to rotation and reflection) to place the elements of S around a
circle such that the product of any two neighbors is of the form x2 + x + k for some nonnegative
integer x.
IMO 2022, problem 3. The version presented here changes “positive integer x” to “nonnegative
integer x;” this removes a nasty, unintended trap. Probably the greatest problem I’ve ever authored;
I’m glad that this particular problem, out of all the ones I’ve created, made it onto the IMO. A
shame that the trap mentioned above couldn’t be removed for the contest, but we can’t win every
time. . .
14

PPPPPP Research

Uploaded by

Copyright:

Available Formats

PPPPPP Research

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

PPPPPP Research

Uploaded by

Copyright:

Available Formats

Personal Public Proof Problem Proposal Potpourri

Problem 1.3. Let n ≥ 2 be an integer. Let P (x1 , x2 , . . . , xn ) be a nonconstant n-variable polynomial

Problem 1.5. Let a0 , b0 , c0 be complex numbers, and define

Problem 1.6 (⋆). Find all functions f : R → R satisfying

for all real a, b, c.

USA TSTST 2019, problem 8.

• each row contains n distinct consecutive integers in some order,

• each column contains m distinct consecutive integers in some order, and

• each entry is less than or equal to s.

USA TSTST 2020, problem 1.

USMCA national finals 2020, Premier division, problem 7.

RMM extras list 2019, problem G6.

USEMO 2020, problem 5. Compare with EGMO 2020, problem 3.

Problem 3.15 (⋆). Let ABCDEF be a convex hexagon satisfying AB ∥ DE, BC ∥ EF , CD ∥ F A,

USAMO 2021, problem 6.

RMM 2021, problem 5.

Problem 3.17 (⋆). Let A1 C2 B1 A2 C1 B2 be an equilateral hexagon. Let O1 and H1 be the

USAMO 2022, problem 2, and JMO 2022, problem 3.

JMO 2022, problem 4.

ELMO SL 2018, problem N1. Anticipated by Putnam 1982, problem B4.

Problem 4.3. Let f : Z → {1, 2, . . . , 10100 } be a function satisfying

gcd(f (x), f (y)) = gcd(f (x), x − y)

USA TSTST 2019, problem 7.

USAMO 2020, problem 4 and JMO 2020, problem 5.

σ(m) − 1 σ(n) − 1 σ(mn) − 1

USEMO 2021, problem 2.

You might also like