Maths Olympiad Prep

Library / /168 of 860

Number theory Difficulty 4.9 AIME Find the answer

Compute the sum of all positive integers nn such that n23000n^{2}-3000 is a perfect square.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Suppose n23000=x2n^{2}-3000=x^{2}, so n2x2=3000n^{2}-x^{2}=3000. This factors as (nx)(n+x)=3000(n-x)(n+x)=3000. Thus, we have nx=2an-x=2a and n+x=2bn+x=2b for some positive integers a,ba, b such that ab=750ab=750 and a<ba<b. Therefore, we have n=a+bn=a+b, so the sum will be just the sum of divisors of 750=2353750=2 \cdot 3 \cdot 5^{3}, which is (1+2)(1+3)(1+5+25+125)=1872(1+2)(1+3)(1+5+25+125)=1872.

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: Omni-MATH, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.