Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

For $a^2+b^2=c^2$ such that $a, b, c \in \mathbb{Z}$

Do we know whether the solution is finite or infinite for $a, b, c \in \mathbb{Z}$?

We know $a=3, b=4, c=5$ is one of the solutions.

share|cite|improve this question
Look up "Pythagorean triples". – Robert Israel Dec 24 '12 at 8:14
I'm guessing that you mean "Do we know whether the number of solutions is finite or infinite?" rather than "Do we know whether the solution is finite or infinite?". – Michael Hardy Dec 24 '12 at 15:48
up vote 5 down vote accepted

Assuming $m,n$ be any two positive integers such that $m < n$, we have:

$$a = n^2 - m^2,\;\; b = 2mn,\;\;c = n^2 + m^2$$

And then $a^2+b^2=c^2$.

share|cite|improve this answer
Small comment: To produce all triples, we need to allow the $a$, $b$, $c$ above to be multiplied by an integer constant $k$. – André Nicolas Dec 24 '12 at 7:29
nice observation! – bsdshell Dec 24 '12 at 8:03

To comment on whether the solution is finite or infinite note that if $(a,b,c)$ satisfy $a^2 + b^2 = c^2$, then so does $(ka,kb,kc)$ where $k \in \mathbb{Z}$. Hence, either no integer solution exists or infinite integer solution exists.

You have already observed that $(3,4,5)$ satisfies $3^2 + 4^2 = 5^2$. Hence, infinite solutions exist.

Babak Sorouh has given the parameterization, which generates almost all possible solutions $a,b,c \in \mathbb{Z}^+$ (without scaling).

share|cite|improve this answer
Thanks for noting an important comment in the first paragraph. Thanks @Andre. – Babak S. Dec 24 '12 at 7:31

You can use your reasoning and conclude that there are infinite right triangles that you could draw, but that is not a good proof.

It is already known that $3^2 + 4^2 = 5^2.$ You can use this statement itself to prove that there are infinitely many Pythagorean Triplets.

Let's prove that there are infinitely many Pythagorean Triplets in the form $(3k)^2 + (4k)^2 = (5k)^2,\ \, k \in \mathbb{N}$.

(NOTE that you can apply this to any Pythagorean Triplet; it's a property).

We have $(3k)^2 + (4k)^2 = (5k)^2$, or $9k^2 + 16k^2 = 25k^2$. Divide both sides by $k^2$ (it is not zero). We have $9 + 16 = 25 \iff 25 = 25$. We just have proved that the statement is true for any $k \in \mathbb{N}$ and there are infinite elements in $\mathbb{N}$.

REMARK The general proof is related.

share|cite|improve this answer
I'm sorry, but I don't see how FLT tells us that the sets of solutions to $a+b=c$ and $a^2+b^2=c^2$ are infinite. Could you explain this? – user50407 Dec 24 '12 at 16:33
Yes, according to the context of FMT. I have edited the post to avoid such further confusions. :) – Parth Kohli Dec 24 '12 at 16:47
I understand that you could say these equations are related, but I don't think that Wikipedia page says anything about FLT implying that the sets of solutions for those equations are infinite (they state that they have an infinite number of solutions, but not that is an indirect or direct consequence of FLT.) – user50407 Dec 24 '12 at 16:59
Might as well remove the Fermat's part. :\ – Parth Kohli Dec 24 '12 at 17:00

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.