How many triples of integers exists such that
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
It is easy to find the smallest "all-positive" triplet:
1 4 + 2 3 = 3 2
Now, it is easy to show, that there are infinitely many triplets, by multiplying our equation by the 12th power ( LCM(2, 3, 4) = 12) of the positive integer k:
k 1 2 ( 1 4 + 2 3 ) = 3 2 × k 1 2
( k 3 ) 4 + ( 2 k 4 ) 3 = ( 3 k 6 ) 2
Now, we can see, that we have infinitely many triplets in the form of:
( k 3 , 2 k 4 , 3 k 6 ) , k ∈ N
Hence, our answer should be:
Infinitely many
Remark:
There are other base triplets (where GCD(a, b, c) = 1 (a.k.a. coprimes)) in existence. Some of them can be found in Chris Lewis's solution. However, just one of them (e.g. the (1, 2, 3) we used here) is sufficient for the proof that there are infinitely many such triplets.