For natural n>1 let 3n+1 be a perfect square.
Prove (n+1) can be written as a sum of 3 perfect squares, not all of which may be distinct.
-
UP 0 DOWN 0 0 1
For natural n>1 let 3n+1 be a perfect square.
Prove (n+1) can be written as a sum of 3 perfect squares, not all of which may be distinct.