Number theoryDifficulty 5.8AIME, harderProve itBrazil
n is a positive integer such that 3n(n+1) is a square. Show that n is a multiple of 3, and n+1 and 3n are squares.
Solution
Suppose 3n(n+1)=m2, so n(n+1)=3m2. n and n+1 are coprime so either
(1) n=3a2 and n+1=b2, or
(2) n=a2 and n+1=3b2.
But (2) implies that 3b2−1 is a square, whereas squares must be 0 or 1 mod 3. So we must have (1).
Want a route through all this instead of an archive? The track
puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.