For the Diophantine equation , either find all integer solutions, or show that there are no integer solutions. How can I use modulo to solve this?
Follow Math Help Forum on Facebook and Google+
Originally Posted by jmedsy For the Diophantine equation , either find all integer solutions, or show that there are no integer solutions. How can I use modulo to solve this? Consider modulo 5. has no integer solutions. has no integer solutions.
Originally Posted by alexmahone Consider modulo 5. has no integer solutions. has no integer solutions. That makes sense. Did you choose (mod 5) just because one of the terms including a variable was a multiple of 5?
Originally Posted by jmedsy That makes sense. Did you choose (mod 5) just because one of the terms including a variable was a multiple of 5? Yes.
View Tag Cloud