2023 AIME I Solutions

Amol Rama and Anthony Wang

February 8, 2023
Contents
Problems 3

Answer Key 6

Problem 1 7

Problem 2 8

Problem 3 9

Problem 4 10

Problem 5 11

Problem 6 12

Problem 7 13

Problem 8 14

Problem 9 15

Problem 10 16

Problem 11 17

Problem 12 18

Problem 13 20

Problem 14 22

Problem 15 24

2
Problems
1. Five men and nine women stand equally spaced around a circle in random order.
The probability that every man stands diametrically opposite a woman is m
n , where
m and n are relatively prime positive integers. Find m + n.
2. Positive real numbers b ̸= 1 and n satisfy the equations
p √
logb n = logb n and b · logb n = logb (bn)
j
The value of n is k, where j and k are relatively prime positive integers. Find
j + k.
3. A plane contains 40 lines, no 2 of which are parallel. Suppose that there are 3
points where exactly 3 lines intersect, 4 points where exactly 4 lines intersect, 5
points where exactly 5 lines intersect, 6 points where exactly 6 lines intersect, and
no points where more than 6 lines intersect. Find the number of points where
exactly 2 lines intersect.
4. The sum of all positive integers m such that 13! m is a perfect square can be written
as 2a 3b 5c 7d 11e 13f , where a, b, c, d, e, and f are positive integers. Find a + b + c +
d + e + f.
5. Let P be a point on the circle circumscribing square ABCD that satisfies P A·P C =
56 and P B · P D = 90, Find the area of ABCD.
6. Alice knows that 3 red cards and 3 black cards will be revealed to her one at a
time in random order. Before each card is revealed, Alice must guess its color. If
Alice plays optimally, the expected number of cards she will guess correctly is m
n,
where m and n are relatively prime positive integers. Find m + n.
7. Call a positive integer n extra-distinct if the remainders when n is divided by
2, 3, 4, 5, and 6 are distinct. Find the number of extra-distinct positive integers
less than 1000.
8. Rhombus ABCD has ∠BAD < 90◦ . There is a point P on the incircle of the
rhombus such that the distances from P to the lines DA, AB, and BC are 9, 5,
and 16, respectively. Find the perimeter of ABCD.
9. Find the number of cubic polynomials p(x) = x3 + ax2 + bx + c, where a, b, and c
are integers in {−20, −10, −18, . . . , 18, 19, 20}, such that there is a unique integer
m ̸= 2 with p(m) = p(2).
10. There exists a unique positive integer a such that the sum
2023
X  n2 − na 
U=
5
n=1

is an integer strictly between −1000 and 1000. For that unique a, find a + U . Here
⌊x⌋ is the greatest integer less than or equal to x.

3
11. Find the number of subsets of {1, 2, 3, . . . , 10} that contain exactly one pair of
consecutive integers. Examples of such subsets are {1, 2, 5} and {1, 3, 6, 7, 10}.

12. Let △ABC be an equilateral triangle with side length 55. Points D, E, and F lie
on BC, CA, and AB, respectively, with BD = 7, CE = 30, and AF = 40. Point
P inside △ABC has the property that

∠AEP = ∠BF P = ∠CDP.

Find tan2 (∠AEP ).

13. Each face

√ of two noncongruent
√ parallelepipeds is a rhombus whose diagonals have
lengths 21 and 31. The ratio of the volume of the larger of the two polyhedra
to the volume of the smaller is mn , where m and n are relatively priem positive
integers. Find m + n. A parallelepiped is a solid with six parallelogram faces such
as the one shown below.

14. The following analog clock has two hands that can move independently of each
other.

0
11 1
10 2
9 3
8 4
7 5
6

Initially, both hands point to the number 12. The cllock performs a sequence of
hand movements so that on each movement, one of the two hands moves clockwise
to the next number on the clock while the other hand does not move.

Let N be the number of sequences of 144 hand movements such that during the
sequence, every possible positioning of the hands appears exactly once, and at the
end of the 144 movements, the hands have returned to their initial position. Find
the remainder when N is divided by 1000.

4
15. Find the greatest prime number p < 1000 such that there exists a complex number
z satisfying
• the real part of z and the imaginary part of z are both integers,
√
• |z| = p, and
• there exists a triangle whose three side lengths are p, the real part of z 3 , and
the imaginary part of z 3

5
Answer Key
1. 191

2. 881

3. 607

4. 012

5. 106

6. 051

7. 049

8. 125

9. 738

10. 944

11. 235

12. 075

13. 125

14. 608

15. 349

6
Problem 1
Problem 1

Five men and nine women stand equally spaced around a circle in random order.
The probability that every man stands diametrically opposite a woman is m
n , where
m and n are relatively prime positive integers. Find m + n.

Solution. We just care about where the men stand (assume they are distinct for now).
The first man can stand in any of the 14 slots. The next man has 12 slots (anything but
where the first one stood and his diametrical opposite). Similarly, the following man has
10 slots, and his successors have 8 and 6 slots, respectively. Thus, there are

14 · 12 · 10 · 8 · 6

ways to arrange them in such a manner, and

 
14
5! = 14 · 13 · 12 · 11 · 10
5

Thus the desired probability is

14 · 12 · 10 · 8 · 6 8·6 48
= =
14 · 13 · 12 · 11 · 10 11 · 13 143

Thus m = 48 and n = 143, so m + n = 191 . ■

7
Problem 2
Problem 2

Positive real numbers b ̸= 1 and n satisfy the equations

p √
logb n = logb n and b · logb n = logb (bn)

The value of n is kj , where j and k are relatively prime positive integers. Find j + k.

√ 1
Solution. Note that logb n= 2 logb n, so
p 1
logb n = logb n =⇒ logb n = 4
2
since if logb n = 0, then n = 1 and the second equation would make no sense. Thus, as
logb (bn) = 1 + logb n, we have
5
4b = 1 + 4 = 5 =⇒ b =
4

Thus, n = b4 = 625/256, giving an answer of 625 + 256 = 881 . ■

8
Problem 3
Problem 3

A plane contains 40 lines, no 2 of which are parallel. Suppose that there are 3
points where exactly 3 lines intersect, 4 points where exactly 4 lines intersect, 5
points where exactly 5 lines intersect, 6 points where exactly 6 lines intersect, and
no points where more than 6 lines intersect. Find the number of points where
exactly 2 lines intersect.

Solution. Note that there are 40

2 = 780 intersection of lines (counting the same point
multiple times possibly). Now, note that if n lines pass through a point, that is n2

intersection points removed. Thus, the number of points where 2 points intersect is
       
3 4 5 6
780 − 3 −4 −5 −6 = 780 − 3 · 3 − 4 · 6 − 5 · 10 − 6 · 15 = 607
2 2 2 2

9
Problem 4
Problem 4

The sum of all positive integers m such that 13! m is a perfect square can be written as
2a 3b 5c 7d 11e 13f , where a, b, c, d, e, and f are positive integers. Find a+b+c+d+e+f .

Solution. Note that each prime is independent, so it is the product of all the values of
m for each prime. Note
13! = 210 · 35 · 52 · 7 · 11 · 13
The constraint of the problem says νp (m) ≡ νp (13!), where νp (k) is the largest number
n such that pn | k. Thus, we have

ν2 (m) ∈ {0, 2, 4, 6, 8, 10}

ν3 (m) ∈ {1, 3, 5}
ν5 (m) ∈ {0, 2}
ν7 (m) = ν11 (m) = ν13 (m) = 1

Thus, the sum of all possible values of m is

(20 + 22 + 24 + 26 + 28 + 210 )(31 + 33 + 35 )(50 + 52 )7 · 11 · 13 = 1365 · 273 · 26 · 7 · 11 · 13

= 2 · 32 · 5 · 73 · 11 · 134

Thus a + b + c + d + e + f = 1 + 2 + 1 + 3 + 1 + 4 = 12 . ■

10
Problem 5
Problem 5

Let P be a point on the circle circumscribing square ABCD that satisfies P A·P C =
56 and P B · P D = 90, Find the area of ABCD.

Solution. Without loss of generality, assume P lies on minor arc AB.

B A

C D

Let R be the radius of the circle. Note ∠BP D = ∠AP C = 90◦ . Note that by the
double-angle formula
2P C · P A 56 28
sin 2∠P CA = = = 2
AC 2 2R2 R
2P B · P D 90 45
sin 2∠P DB = = = 2
BD2 2R2 R
However, these angles add up to 90◦ . Thus, sin 2∠P CA = cos 2∠P DB. In particular,
we have  2  2
2 2 28 45 2809
1 = sin 2∠P CA + sin 2∠P DB = + =
R2 R2 R4
Thus, R2 = 53. Note [ABCD] = 2R2 = 106 . ■

11
Problem 6
Problem 6

Alice knows that 3 red cards and 3 black cards will be revealed to her one at a time
in random order. Before each card is revealed, Alice must guess its color. If Alice
plays optimally, the expected number of cards she will guess correctly is mn , where
m and n are relatively prime positive integers. Find m + n.

Solution. Note that she has a 50% chance of getting the first card right, and she will get
the last card right. Thus, we only have to look at the middle four cards.

Her strategy is to guess the majority card. There is a 3/5 chance she gets the second
card correct. If she does, she is left with 2 of each color. In this case, there’s a 1/2 she
gets the next card, and is left with BBR or BRR.

If she gets the next card wrong, then she has 3 of one color and one of the last. If she
gets the next one wrong, with probability 14 , she is left with BBB or RRR, which is
2 guaranteed (ignoring the last card, which is already counted). Otherwise, we end up
with BBR or BRR.

When we have BRR or its symmetric, there are two cases. If we get the first card wrong,
the next is guaranteed right, for a probability of 1/3. Otherwise, we have an 1/2 chance of
guessing the fifth card right, for an expected value 2/3(1 + 1/2) = 1. Thus, the expected
value from here is 4/3.

Thus, in the case of getting the second card right, the expected value is
1 4 17
1+ + =
2 3 6
If she gets it wrong, the expected value is instead
1 3 4 9
· 2 + (1 + · ) =
4 4 3 4
Thus, our overall expected value is
1 3 17 2 9 41
+1+ · + · =
2 5 6 5 4 10

for an answer of 41 + 10 = 51 . ■

12
Problem 7
Problem 7

Call a positive integer n extra-distinct if the remainders when n is divided by

2, 3, 4, 5, and 6 are distinct. Find the number of extra-distinct positive integers less
than 1000.

Solution. Assume n is extra-distinct. Note that if we know the value of n (mod 2), then
there is one possible value of n (mod 4), and thus one value of n (mod 6). This means
that n (mod 3) is also fixed.

If n ≡ 0 (mod 2), we know n ≡ 2 (mod 4), n ≡ 4 (mod 6), and n ≡ 1 (mod 3). Thus,
necessarily n ≡ 3 (mod 5) and n ≡ 58 (mod 60).

Otherwise, n ≡ 1 (mod 2), so n ≡ 3 (mod 4), n ≡ 5 (mod 6), and n ≡ 2 (mod 3).
Thus, n ≡ 0, 4 (mod 5), and n ≡ 35, 59 (mod 60).

Thus, we have either n ≡ 35, 58, 59 (mod 60). Note that in the interval [0, 960), there
are 16 values of n for each residue. In the interval [960, 1000), there is only one total
(995 ≡ 35 (mod 60)), for an answer of 16 · 3 + 1 = 49 . ■

13
Problem 8
Problem 8

Rhombus ABCD has ∠BAD < 90◦ . There is a point P on the incircle of the
rhombus such that the distances from P to the lines DA, AB, and BC are 9, 5, and
16, respectively. Find the perimeter of ABCD.

D C

O2

P2
O
Q2

P1
P

A Q1 O1 B

Solution. Note that BC ∥ AD, and the distance between them is 9 + 16 = 25. However,
this is twice the inradius, so thus the inradius is 25
2 . Suppose O is the center of the
rhombus. Let O1 be the projection of O onto AB, and P1 , Q1 are the projections of P
onto OO1 and AB, respectively. Define O2 , P2 , and Q2 similarly on AD. Then, △OP P1
is a right triangle with OP = 25/2 and OP1 = OO1 −O1 P1 = OO1 −P Q1 = 25/2 −5 = 15/2,
so q
Q1 O1 = P P1 = OP 2 − OP12 = 10
Similarly, OP2 = 7/2, so Q2 O2 = 12. Thus, note AQ2 = AQ1 = x, so
p q q p
92 + (x = 12)2 = AQ22 + Q2 P 2 = AP = AQ21 + Q1 P 2 = 52 + (x − 10)2

This means

2(x − 22) = (x − 10)2 − (x − 12)2 = 92 − 52 = 56 =⇒ x = 25

Note that OAO1 ∼ OO1 B, so BO1 = OO12 /AO1 = 25/4. Thus,

 
25
perimeter = 4 · AB = 4 25 + = 125
4
■

14
Problem 9
Problem 9

Find the number of cubic polynomials p(x) = x3 + ax2 + bx + c, where a, b, and c

are integers in {−20, −10, −18, . . . , 18, 19, 20}, such that there is a unique integer
m ̸= 2 with p(m) = p(2).

Solution. Note that c does not matter, so we will multiply by 41 at the end. Note that
the polynomial must either now be (x − 2)2 (x − k) + C or (x − 2)(x − k)2 + C, where
k ̸= 2, as otherwise, as a is an integer, it would be (x − 2)(x − k)(x − ℓ) + C where
2 ≠= k ̸= ℓ and then m is not unique

Now, we consider the two cases. We note

(x − 2)2 (x − k) = x3 − (k + 4)x2 + (4k + 4)x − 4k

Thus, −20 ≤ 4k + 4 ≤ 20, so −6 ≤ k ≤ 4. Taking out k = 2, this gives 10 solutions.

Now, in the other case,

(x − 2)(x − k)2 = x3 − (2k + 2)x2 + (k 2 + 4k)x − 2k 2

This means that −20 ≤ k 2 + 4k ≤ 20. Note that k 2 + 4k ≥ −4, so the only constraint is
the second, where we get −6 ≤ k ≤ 2. Excluding k = 2, we get 8 solutions here.

Thus, the answer is 41 · (10 + 8) = 738 . ■

15
Problem 10
Problem 10

There exists a unique positive integer a such that the sum

2023
X  n2 
− na
U=
5
n=1

is an integer strictly between −1000 and 1000. For that unique a, find a + U . Here
⌊x⌋ is the greatest integer less than or equal to x.

Solution. The key idea is that the summation without the floors should be close to 0
because each floor can only change the sum by less than 1. The natural choice is a value
of a near the one that makes the aforementioned sum exactly 0. Luckily, we compute
2023
n2 − na
 
X 1 2023 · 2024 · 4047 2023 · 2024
= −a ,
5 5 6 2
n=1

which is zero at a = 4047/3 = 1349, an integer. Trying a = 1349 for the value of U , we
have
2023
X  n2 − 1349n  2023X  n2 − 1349n (n2 − 1349n) mod 5 
U= = −
5 5 5
n=1 n=1
2023
1X 2
=− (n − 1349n) mod 5
5
n=1

But note that n2 − 1349n ≡ n2 + n (mod 5) takes on the following values at the residues
mod 5,
n (n2 + n) mod 5
1 2
2 1
3 2
4 0
0 0
Finally, note that n = 1 to n = 2023 passes through almost 405 periods of length 5, only
missing two zeroes that don’t matter, with each period summing to 5, so
1
U = − (405 · 5) = −405.
5

It follows that a + U = 1349 − 405 = 944 . ■

16
Problem 11
Problem 11

Find the number of subsets of {1, 2, 3, . . . , 10} that contain exactly one pair of
consecutive integers. Examples of such subsets are {1, 2, 5} and {1, 3, 6, 7, 10}.

Solution. We have the following crucial claim:

Claim:

The number of subsets of {k, k + 1, . . . , k + n − 1} without two consecutive numbers

is Fn+2 , where Fn is the nth Fibonacci number.

Proof. Note that this is true for n = 0, 1, so it suffices to show that the sets satisfy the
Fibonacci recurrence. Let the desired value be Sn . If k + n − 1 is not in our set, we have
Sn−1 possible ways to fill the rest. Otherwise, if k + n − 1 is in our set, k + n − 2 is not,
so thus we have Sn−2 possible ways to fill the rest. Thus,

Sn = Sn−1 + Sn−2

as desired. ■

Now, to finish, if the consecutive numbers are m, m + 1, then m − 1, m + 2 are not in

the subset. Then, the rest is subsets of {1, . . . , m − 2} and {m + 3, . . . , 10} with no two
consecutive numbers, for a total of Fm−2+2 F10−m−2+2 = Fm F10−m . Thus, the answer is
9
X
Fm F10−m = 1 · 34 + 1 · 21 + 2 · 13 + 3 · 8 + 5 · 5 + 8 · 3 + 13 · 2 + 21 · 1 + 34 · 1 = 235
m=1

17
Problem 12
Problem 12

Let △ABC be an equilateral triangle with side length 55. Points D, E, and F lie
on BC, CA, and AB, respectively, with BD = 7, CE = 30, and AF = 40. Point P
inside △ABC has the property that

∠AEP = ∠BF P = ∠CDP.

Find tan2 (∠AEP ).

D′ A

F
P

B D C

Solution. Note that P is the Fermat Point of △DEF , so the intersection of P D and
(EP F ), say D′ , forms equilateral triangle D′ EF . Thus, we find D′ , and then can find
tan2 ∠D′ DC.

Throw this onto the complex plane, and let B = 0 and C = 55. Then, A = 55eiπ/3 , so
D = 7, E = 30/55 · A + 25/55 · C = 30eiπ/3 + 25, and F = 15eiπ/3 . Thus,

D′ = (E − F ) · eiπ/3 + F

18
Let ω = eiπ/3 . Then,

D′ = (15ω + 25)ω + 15ω = −15 + 55ω

Thus,
√ !
−−→′ 1 5 3
DD = 55ω − 22 = 11 + i
2 2
so the desired value is the argument of this, or
 √ 2
5 3/2
1/2
= 75

19
Problem 13
Problem 13

Each face
√ of two noncongruent
√ parallelepipeds is a rhombus whose diagonals have
lengths 21 and 31. The ratio of the volume of the larger of the two polyhedra
to the volume of the smaller is mn , where m and n are relatively priem positive
integers. Find m + n. A parallelepiped is a solid with six parallelogram faces such
as the one shown below.

Solution 1. Note that the side length of the rhombus is

1 √ 2 √ 2 √
q
s := 21 + 31 = 13.
2
Furthermore, it is well known that the volume of a parallelepiped is six times a corre-
sponding “corner” tetrahedron. For the √ two given parallelepipeds, said tetrahedra are
right triangular pyramids with apex 13 away from √ the √ vertices of the base and with
bases that are equilateral triangles of side length 21 or 31.
Scale the pyramids up by a factor of 2. We will simply compute their
q volumes directly.
√ √ √ 2
2
For the pyramid with base side length 2 21, the slant height is (2 13) − 21 =
√
√31, √and the distance from the center of the equilateral triangular base to a side is
21/ 3. Thus, the triangular pyramid has true height
√ √
√ 2 √ 2
q r
3 · 31 − 21 72 2
31 − 21 /3 = √ = √ =6 ,
3 3 3

and volume, √ √
√
r
1 (2 21)2 3 2
V1 = · ·6 = 21 · 2 2.
3 4 3
√ q √ √ 2
Similarly, the pyramid with base side length 2 31, the slant height is (2 13)2 − 31 =
√
√21, √
and the distance from the center of the equilateral trianglur base to a side is
31/ 3. Thus, the triangular pyramid has true height
√ √
√ 2 √ 2
q r
3 · 21 − 31 32 2
21 − 31 /3 = √ = √ =4 ,
3 3 3

20
and volume, √ √
4√
r
1 (2 31)2 3 2
V2 = · ·4 = 31 · 2.
3 4 3 3
Therefore, the ratio is √
V1 21 · 2 2 63
= 4
√ = =⇒ 125 .
V2 31 · 3 2 62
■
Solution 2. Note that the volume of a parallelopiped is simply
V = (a × b) · c
where a, b, c are the three sides. Note that this is the triple product, so
 
ax ay az 

V = det M =  bx by bz 
 cx cy cz 
Thus, if α, β, γ are the angles ∠(b, c), ∠(c, a), ∠(a, b),
V 2 = det(M · M⊺ )
 a2x + a2y + a2z
 
a x bx + ay by + a z bz a x cx + a y cy + a z cz 
2 2 2
 
= det bx ax + by ay + bz az
 bx + by + bz bx cx + by cy + bz cz 
cx ax + cy ay + cz az cx bx + cy by + cz bz c2x + c2y + c2z 
 
a · a a · b a · c
 
= det b · a b · b b · c
c · a c · b c · c
= a2 (b2 c2 − b2 c2 cos2 α) − ab cos γ(abc2 cos γ − abc2 cos α cos β)
+ ac cos β(ab2 c cos γ cos α − ab2 c cos β)
= a2 b2 c2 (1 + 2 cos α cos β cos γ − cos2 α − cos2 β − cos2 γ)
Note that the side length of the rhombus is
1 √ 2 √ 2 √
q
21 + 31 = 13
2
Let θ be the acute angle of the rhombus. Note
r √
1 − cos θ 1 21
= sin θ = √
2 2 2 13
Thus,
1 − cos θ 21 5
= =⇒ cos θ =
2 52 26
Thus, the ratio of the volumes is
1 + 2(5/26)3 − 3(5/26)2 63
3 2
=
1 − 2(5/26) − 3(5/26) 62
Thus the answer is 63 + 62 = 125 . ■

21
Problem 14
Problem 14

The following analog clock has two hands that can move independently of each
other.

0
11 1
10 2
9 3
8 4
7 5
6

Initially, both hands point to the number 12. The cllock performs a sequence of
hand movements so that on each movement, one of the two hands moves clockwise
to the next number on the clock while the other hand does not move.

Let N be the number of sequences of 144 hand movements such that during the
sequence, every possible positioning of the hands appears exactly once, and at the
end of the 144 movements, the hands have returned to their initial position. Find
the remainder when N is divided by 1000.

Solution. Consider a 12 × 12 grid (from (0, 0) to (11, 11)) and call a point (x, y) good if
x + y ≡ 0 (mod 12). Note that if we plot the movements on the grid (and add portals
along x = 12 and y = 12 to go to x = 0 and y = 0, respectively), we get a path visiting
every point exactly once. Furthermore, every 12 steps we hit a good point (as x + y
increases by 1 each time).

Consider the path from (0, 0), and suppose the first good point it hits is P . The following
claim is the crux of the problem:

Claim:

The entire grid is just the aformentioned path, repeated.

Proof. We show that the path must repeat to the bottom right (by one square), which
is enough by repeating the argument several times.

Suppose the path is P0 = (0, 0), P1 , . . . , P12 = P . If Pk Pk+1 is horizontal, tbe point

22
below Pk can not go up, so it goes right, parallel. Similarly, if Pk Pk+1 is vertical, we
know the point to the right of Pk+1 did not originate at Pk+1 (assuming this isn’t on the
path) , so it originated at the point right of Pk . Thus, we only have to mind turns.

If Pk−1 Pk is horizontal and Pk Pk+1 is vertical, then we know the point below of Pk can
not go to Pk , so it must go to the bottom right. Similarly, the point to the right of Pk
can not start at Pk , so it must start at the bottom right point.

The green is the mentioned path Pk−1 Pk Pk+1 . The blue segments is what is
forced already. The red are invalid segments, hence the purple segments
must complete the path.

Similarly, on the other type of turn, the segments are already known (the purple ones
don’t exist, as we’re on the “inside corner”). Thus, the path must repeat. ■

Now, to finish, we note that as this repeats, the first good point must have both coordi-
nates relatively prime to 12 (otherwise if kx is a multiple of 12, and so is ky, for k < 12,
then the 12kth point is (0, 0), absurd). Thus, it is either (1, 11), (5, 7), or its reflections
over y = x. Thus there are
   
12 12
2 + = 2 · 804 = 1608
1 5

paths, leading to an answer of 608 . ■

23
Problem 15
Problem 15

Find the greatest prime number p < 1000 such that there exists a complex number
z satisfying

• the real part of z and the imaginary part of z are both integers,
√
• |z| = p, and

• there exists a triangle whose three side lengths are p, the real part of z 3 , and
the imaginary part of z 3

Solution. Assume that z = a + bi. Then,

z 3 = (a3 − 3ab2 ) + (3a2 b − b3 )i

Note that by the Triangle Inequality,

|(a3 − 3ab2 ) − (3a2 b − b3 )| < p =⇒ |a3 + b3 − 3ab2 − 3a2 b| < a2 + b2

Thus, we know
|a + b||a2 + b2 − 4ab| < a2 + b2
Without loss of generality, assume a > b (as otherwise, consider i3 z = b+ai). If |a/b| ≥ 4,
then

17b2 ≥ a2 + b2 > |a + b||a2 + b2 − 4ab| ≥ |b − 4b||16b2 − 16b2 + b2 | = 3b3

17
√
Thus, this means b ≤ 3 or b ≤ 5. Also note that the roots of x2 − 4x + 1 are 2 ± 3,
so thus if b ≥ 6, √ √
2 3b = (2(2 − 3) − 4)b < a < 4b
Note that
1000 > p = a2 + b2 ≥ 12b2 + b2 = 13b2
√
so b2 < 81, and b < 9. If b = 8, then 16 3 ≤ a ≤ 32. Note that gcd(a, b) = 1, and a ̸≡ b
(mod 2), so a = 29 or 31. However, then 5 | a2 + b2 , absurd.
√
If b = 7, by similar logic, we have that 14 √3 < a < 28, so b = 26. However, once again,
2 2
5 | a + b . If b = 6, by the same logic, 12 3 < a < 24, so a = 23, where we run into
the same problem. Thus b ≤ 5 indeed.

If b = 5, note that

(a + 5)(a2 + 25 − 20a) < a2 + 25 =⇒ a < 20

24
We note that p = 52 + 182 = 349 works. Thus, we just need to make sure that if b ≤ 4,
a ≤ 18. But this is easy, as

p > (a + b)(a2 + b2 − 4ab) ≥ (4 + 18)(42 + 182 − 4 · 4 · 18) > 1000

absurd. Thus, the answer is 349 . ■

25