Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
Prove the cancellation rule: if and , then . Then use it on . Find how many solutions lie from to , the smallest solution and the sum of all the solutions in that range. Explain why the solutions are equally spaced.
is solvable exactly when divides , and then it has solutions modulo :
Check an answer or open a hint to unlock the worked solution.
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, go through the solution one step at a time, and check each step against your own.
Given. , .
Step 1. The proof. We have . Write and . Then , so . Since , the number shares no factor with , so . That is . Proof complete.
Step 2. The gcd. , and . So there are solutions modulo .
Step 3. Divide by 6. . The inverse of modulo is , so .
Step 4. The list. , one every , because a solution modulo repeats every .
Step 5. The sum. , or .
Check. , and .
Answer: solutions, the smallest , with sum .
Log in to join the discussion.
Loading…