Problem:
Let be the number of ordered pairs of integers such that
Remember, integers may be positive, negative, or zero!
a. Prove that is odd.
b. Prove that is not divisible by .
Problem:
Let be the number of ordered pairs of integers such that
Remember, integers may be positive, negative, or zero!
a. Prove that is odd.
b. Prove that is not divisible by .
Solution:
a.
If is a pair of integers that satisfies the inequality, then is also such a pair, since
So we can match up pairs of solutions to the inequality, . Every solution will be paired with a different solution, except for the one remaining solution which is paired with itself. This shows that the number of solutions is odd.
b.
This is similar to the previous part, except now that we have to arrange the nonzero solutions into triples instead of pairs. If is a solution to the inequality, then so is , since
Applying this transformation three times in succession gives the cycle
so we can unambiguously arrange the solutions into cycles of three, of the form . Now, if any two solutions in the same cycle are equal, then the third is also equal to them, so every cycle contains either three distinct solutions or just one solution. If a cycle contains just one solution , then and gives . Therefore, the solution forms a cycle by itself, and every other cycle consists of three different solutions, which means that the total number of solutions has remainder when divided by .