Maths Olympiad Prep

Library / /13 of 48

Number theory Difficulty 5.0 AIME Prove it Hong Kong

Find all positive integer(s) nn such that n2+32n+8n^2 + 32n + 8 is a perfect square.

Solution

nn can be 4747 or 1717.

Suppose n2+32n+8=m2n^2 + 32n + 8 = m^2 where mm is a positive integer. Note that this can be rewritten as (n+16)2248=m2(n+16)^2 - 248 = m^2, which implies
(n+m+16)(nm+16)=248=23×31. (n + m + 16)(n - m + 16) = 248 = 2^3 \times 31.
Hence, (n+m+16,nm+16)=(248,1),(124,2),(62,4),(31,8)(n+m+16, n-m+16) = (248, 1), (124, 2), (62, 4), (31, 8). For each pair, we can solve the system of two linear equations in two unknowns. The only positive integer solutions are (n,m)=(47,61),(17,29)(n, m) = (47, 61), (17, 29).

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.