If someone could point me in the correct direction to start this proof I would be most appreciative:
Prove there does not exist 2 integers a and d with a^2 - 8d^2 = 35 using this information:
1. use contradiction
2. consider the integers modulo 8
3. use modular arithmetic
4. use the result of the division algorithm that every integer is congruent modulo m to exactly 1,2,3,..,m-1
Prove there does not exist 2 integers a and d with a^2 - 8d^2 = 35 using this information:
1. use contradiction
2. consider the integers modulo 8
3. use modular arithmetic
4. use the result of the division algorithm that every integer is congruent modulo m to exactly 1,2,3,..,m-1