Prove that the equation $a^2 +b^2 =c^2 +3$ has infinitely many integer solutions $(a, b, c)$.
Problem
Source:
Tags: Diophantine Equations, pen
Peter
30.08.2007 10:05
If $ a+1=n^{2}$, then $ (2n)^{2}+(2a)^{2}=(2a+1)^{2}+3$, since there are infinitely many $ a$ for which $ a+1$ is a perfect square, this solves the problem.
jgnr
24.12.2008 08:51
$ a=2k, b=2k^2-2,c=2k^2-1$
Peter
24.12.2008 14:06
Johan Gunardi wrote: $ a = 2k, b = 2k^2 - 2,c = 2k^2 - 1$ I think that's not correct: look at the coefficient of $ k$...
ZetaX
24.12.2008 14:13
$ (2k)^2+(2k^2-2)^2 - (2k^2-1)^2 = 4k^2+4k^4-8k^2+4-4k^4+4k^2+1 = 3$, so it works.
Peter
24.12.2008 14:14
I'm sorry, must have missed the squares. Never mind.
makar
01.01.2017 01:38
Can we find all solutions ?