a 2 + b 3 = c 2
How many positive integral triple(s) ( a , b , c ) are there such that the equation above is fulfilled?
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.
I didn't know this identity, so I approached it in a slightly different way.
a 2 + b 3 = c 2 ⟹ c 2 − a 2 = b 3 ⟹ ( c + a ) ( c − a ) = b 3
Lemma: Every odd positive integer x can be expressed as ( z − a ) ( z + a ) for some integer a , z
Proof: Every odd positive integer can be expressed in the form 2 i + 1 for some integer i . Take z = i + 1 and a = i . So, we get,
( z − a ) ( z + a ) = x = 2 i + 1 ⟹ ( i + 1 − i ) ( i + 1 + i ) = 2 i + 1 ⟹ 2 i + 1 = 2 i + 1
This shows that the lemma we have established is indeed an identity for all odd positive integers x and hence the lemma is proved.
Using this lemma and the fact that b 3 is odd for odd b , we can conclude that for every odd b , we always have some integral values of a , c . And since the set of odd positive integers is infinite, we have infinitely many integral triples of ( a , b , c ) .
Log in to reply
Thank you.This is really a nice solution and I did not knew the lemma .But knowing the identity made it easier.
By the way, you might consider editing your solution since the infinitely many triples aren't of the form of ( n , ( n + 1 ) , ( n + 2 ) ) .
Take n = 0 . The triple ( 0 , 1 , 2 ) doesn't satisfy the equation.
The triples will be of the form ( 2 n ( n + 1 ) , n + 1 , 2 ( n + 1 ) ( n + 2 ) )
Log in to reply
but for every triple n , ( n + 1 ) , ( n + 2 ) we will get the other triple integral.And you should put the the value of n in the the right place.
Log in to reply
It works like this: Suppose ( 0 , 1 , 2 ) is a possible triple for ( a , b , c ) . Then, a = 0 , b = 1 , c = 2 must satisfy the given equation. And you specified that the triples are of the form ( n , n + 1 , n + 2 ) for integral n . If so, then we can have n = 0 for a case. Then, according to you, ( 0 , 1 , 2 ) is a solution. Now, is it a solution?
Log in to reply
@Prasun Biswas – If \(n=0) the the equation comes
\([\frac {0(0+1)}{2}]^2+(0+1)^3=[\frac {(0+1)(0+2)}{2}]^2\)
0 + 1 3 = 1 2
I think satisfying
Log in to reply
@Kalpok Guha – On the other hand, I'm interpreting your solution (as most people do) as saying that ( 0 , 1 , 2 ) satisfies the equation, i.e.,
0 2 + 1 3 = 2 2 ⟹ 0 + 1 = 4 ⟹ 1 = 4
Is this true?
I did it the same way !! :) .. (But got stuck at the penultimate step :") )
Let b be an even perfect square.
Then, let d = b . d is clearly also even.
We can now rewrite the equation as a 2 + ( d 3 ) 2 = c 2 .
Since d is even, d 3 is divisible by 4 .
We can now just get a Pythagorean triple by scaling a 3-4-5 triangle.
Since this works for all even squares b , the answer is Infinitely Many
I honestly noticed none of the options was 0.so,at least one solution exist.If we multiply both sides by any 6th power,we can get another solution from it. Hence,infinitely many solutions exist.
Note that ( a , b , c ) = ( n , 0 , n ) is always a solution for all integer n .
0 is not a positive integer.
Log in to reply
Oops, I've made a mistake. Sorry for that.
And the only squares of integers that have a difference of 1 are 1 and 0 . Because 0 is not allowed (being a non-positive integer), the equation is impossible, therefore having 0 answers.
Problem Loading...
Note Loading...
Set Loading...
We know,
[ 2 n ( n + 1 ) ] 2 + ( n + 1 ) 3 = [ 2 ( n + 1 ) ( n + 2 ) ] 2
There are infinite triples of [ n , ( n + 1 ) , ( n + 2 ) ]
Thus the answer is I n f i n i t e l y M a n y