How many pairs of positive integers ( b , c ) are there such that
1 7 2 6 6 2 + b 2 = c 2 ?
This problem is of this series: Number is all around
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.
What about ( 1 7 2 6 6 , 7 6 8 2 4 0 , 7 6 8 4 3 4 ) ?
Log in to reply
Thank you, bro. You are right. I didn't notice it before. Now I have updated my solution and reported in report section to update the answer.
Another possible way to solve it would be to just subtract b 2 onto the other side; then factor the right side as ( c + b ) ( c − b ) . Then using the fact that the prime factorization of 1 7 2 6 6 is 2 ⋅ 8 9 ⋅ 9 7 , set up all the possible systems of equations of the form c + b = x , c − b = y , where x , y , b , c are integers, x y = 1 7 2 6 6 2 , and x > y ( x > y because b and c are positive). You can cut the number of combinations by noting that x and y must be even because otherwise b and c would not be integers. Skipping the process of trying all such combinations, the four systems are c + b = 2 ⋅ 9 7 2 , c − b = 2 ⋅ 8 9 2 c + b = 2 ⋅ 8 9 2 ⋅ 9 7 2 , c − b = 2 c + b = 2 ⋅ 8 9 2 ⋅ 9 7 , c − b = 2 ⋅ 8 9 c + b = 2 ⋅ 8 9 ⋅ 9 7 2 , c − b = 2 ⋅ 8 9
Problem Loading...
Note Loading...
Set Loading...
Relevant Wiki: Pythagorean Triple
From Euclid's Formula we write 1 7 2 6 6 = 2 k m n b = k ( m 2 − n 2 ) c = k ( m 2 + n 2 ) where k , m , n ϵ N and m > n
Then we get k m n = 8 6 3 3
The divisor of 8 6 3 3 are 1 , 8 9 , 9 7 , 8 6 3 3 . So k could be 1 , 8 9 , 9 7
1 . For k = 1 ; m n = 8 6 3 3
If m = 8 6 3 3 , n = 1 we get b = 8 6 3 3 2 − 1 2 = 7 4 5 2 8 6 8 8 and c = 8 6 3 3 2 + 1 2 = 7 4 5 2 8 6 9 0
Again m = 9 7 , n = 8 9 we get b = 9 7 2 − 8 9 2 = 1 4 8 8 and c = 9 7 2 + 8 9 2 = 1 7 3 3 0
Here we get 2 triples. They are: ( 1 7 2 6 6 , 7 4 5 2 8 6 8 8 , 7 4 5 2 8 6 9 0 ) and ( 1 7 2 6 6 , 1 4 8 8 , 1 7 3 3 0 )
2 . For k = 8 9 ; m n = 9 7
If m = 9 7 , n = 1 we get b = 8 9 ( 9 7 2 − 1 2 ) = 8 3 7 3 1 2 and c = 8 9 ( 9 7 2 + 1 ) = 8 3 7 4 9 0
Here we get 1 triple. It is ( 1 7 2 6 6 , 8 3 7 3 1 2 , 8 3 7 4 9 0 )
3 . For k = 9 7 ; m n = 8 9
If m = 8 9 , n = 1 we get b = 9 7 ( 8 9 2 − 1 2 ) = 7 6 8 2 4 0 and c = 9 7 ( 8 9 2 + 1 2 ) = 7 6 8 4 3 4
Here we get 1 triple. It is ( 1 7 2 6 6 , 7 6 8 2 4 0 , 7 6 8 4 3 4 )
So total triples are 4