2023 AIME I Problem 15

Below is the professionally curated solution for Problem 15 of the 2023 AIME I, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2023 AIME I solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:complex numberprimetriangle inequalityfactoring

Difficulty rating: 3370

15.

Find the largest prime number p<1000p \lt 1000 for which there exists a complex number zz satisfying

• the real and imaginary part of zz are both integers;

z=p,|z| = \sqrt{p}, and

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

Solution:

Write z=a+biz = a + bi with a2+b2=p,a^2 + b^2 = p, so p=2p = 2 or p1(mod4),p \equiv 1 \pmod 4, and the pair {a,b}\{|a|, |b|\} is then unique. Replacing zz by ±z,\pm z, ±zˉ,\pm\bar{z}, ±iz,\pm iz, ±izˉ\pm i\bar{z} only changes the real and imaginary parts of z3z^3 by signs and swaps, so we may take a>b>0,a \gt b \gt 0, and the two candidate side lengths are Rez3|\operatorname{Re} z^3| and Imz3.|\operatorname{Im} z^3|. Expanding z3=(a33ab2)+(3a2bb3)iz^3 = (a^3 - 3ab^2) + (3a^2b - b^3)i and factoring, Rez3+Imz3=(ab)(p+4ab),Rez3Imz3=(a+b)(p4ab).\operatorname{Re} z^3 + \operatorname{Im} z^3 = (a - b)(p + 4ab), \qquad \operatorname{Re} z^3 - \operatorname{Im} z^3 = (a + b)(p - 4ab). The triangle exists exactly when ReIm<p<Re+Im,\bigl||\operatorname{Re}| - |\operatorname{Im}|\bigr| \lt p \lt |\operatorname{Re}| + |\operatorname{Im}|, and those two quantities are, in some order, the absolute values above. Since a>ba \gt b forces (ab)(p+4ab)>p,(a - b)(p + 4ab) \gt p, the whole condition reduces to (a+b)p4ab<p.(a + b)\,|p - 4ab| \lt p.

Because a+b>a2+b2=p,a + b \gt \sqrt{a^2 + b^2} = \sqrt{p}, this requires p4ab<p<32:|p - 4ab| \lt \sqrt{p} \lt 32: the products 4ab4ab and a2+b2a^2 + b^2 must nearly coincide. Checking the primes p1(mod4)p \equiv 1 \pmod 4 below 10001000 from the top down, each with its unique representation (for instance 997=312+62997 = 31^2 + 6^2 gives (a+b)p4ab=37253,(a+b)|p - 4ab| = 37 \cdot 253, far too big), the condition fails for every prime greater than 349349 and holds for 349=182+52,349 = 18^2 + 5^2, where (a+b)p4ab=23349360=253<349.(a + b)\,|p - 4ab| = 23 \cdot |349 - 360| = 253 \lt 349.

Indeed for z=18+5iz = 18 + 5i we get z3=4482+4735i,z^3 = 4482 + 4735i, and the lengths 349,349, 4482,4482, 47354735 form a valid triangle. The answer is 349.349.

← Problem 14Full Exam

Problem 15 in Other Years