Find the number of ordered pairs of positive integers satisfying the above equation.
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.
2 0 = 2 5 ⟶ 2 5 1 = x 1 + y 1 = a 5 1 + b 5 1 . Then it's sufficient to find ordered pairs of positive integers ( a , b ) such that 2 1 = a 1 + b 1 and the only solutions are ⎩ ⎪ ⎨ ⎪ ⎧ ( a , b ) = ( 4 , 4 ) ( a , b ) = ( 3 , 6 ) ( a , b ) = ( 6 , 3 ) . Therefore, the only solutions are ⎩ ⎪ ⎨ ⎪ ⎧ ( x , y ) = ( 8 0 , 8 0 ) ( x , y ) = ( 4 5 , 1 8 0 ) ( x , y ) = ( 1 8 0 , 4 5 ) Important Note.- If 2 5 1 = x 1 + y 1 = a c 1 + b d 1 where a , b are positive integers numbers and c , d are free-square positive integers numbers, then squaring this equation, we get 2 0 1 = a 2 c 1 + a b c d 2 + b 2 d 1 and then LHS is a rational number and this implies that c = d , because if c = d then RHS is an irrational number, and this is a contradiction... Therefore, c = d and then c = d = 5 due to Fundamental Arithmetic Theorem and squaring again...