Library / /2 of 28
, 2024
Number theory Difficulty 4.7 AIME Prove it United States
Problem:
Compute the sum of all integers n such that n2−3000 is a perfect square.
Solution
Solution:
If n2−3000 is a square, then (−n)2−3000 is also a square, so the sum is 0.
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.