How many triplets of positive integers exist 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.
There would be 3 options for a , for if a > 3 , then a 6 > 2 0 1 8 .
Also note that a square, mod 3 , can either be 0 or 1 .
If a = 1 , then b 2 + c 3 = 2 0 1 7 ⟹ b 2 + c 3 ≡ 1 ( m o d 3 ) . therefore, we cannot have c = 3 k + 2 , for k being a non-negative integer. So, we need to check 8 possibilities for 0 < c < ( 2 0 1 7 ) 3 1 . There is only one solution here ( 1 , 1 7 , 1 2 ) .
For a = 2 , we have b 2 + c 3 = 1 9 5 4 and we need to check odd c in the range 0 < c < ( 1 9 5 4 ) 3 1 . there would be 6 possibilities and, at the end, the would be one solution ( 2 , 3 5 , 9 ) .
For a = 3 , b 2 + c 3 = 1 2 8 9 . There are 1 0 possibilities for 0 < c < ( 1 2 8 9 ) 3 1 . Two solution emerges eventually ( 3 , 1 7 , 1 0 ) and ( 3 , 3 5 , 4 ) .