How many ordered pairs of integers satisfy the 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.
If we reduce the equation to modulus 4, we'll get that:
n 4 ≡ 3 ( m o d 4 )
Now, spliting n 4 into two cases that cover all possibilities:
2 k 4 = 1 6 k 4 ≡ 0 ( m o d 4 )
( 2 k + 1 ) 4 = 1 6 k 4 + 3 2 k 3 + 2 4 k 2 + 8 k + 1 ≡ 1 ( m o d 4 )
So the division of a number on the form k 4 by 4 is either 0 or 1, meaning that we have a contradiction and the equation has no solutions.