Solve in Z :

Printable View

- Feb 25th 2010, 12:16 AMdhiabmod121
Solve in Z :

- Feb 25th 2010, 01:07 AMBacterius
Hello, Dhiab,

__Solution__: never divides , so this equation has no solutions in

__Proof__: . Apply an exhaustive search on (since values wrap around beyond this interval), and prove that none of the values of the quadratic modulo are divisible by .

Sorry, didn't come up with anything smarter yet (Cool) - Feb 25th 2010, 01:20 AMHallsofIvy
. Obviously is congruent to 5 (mod 121) and any other number that divides 121 must also divide 11. So it is sufficient to do an "exhaustive search" of numbers in [0, 10].