Try it on paper first. A hint, the key idea and the worked solution are here when you need them.
The square of is , which ends in again. Find every with and . Split the modulus as and use the Chinese remainder theorem. Give the number of solutions and the two solutions that are not or , and say why makes the split easy.
With pairwise coprime moduli, a system has one solution modulo . Lift one congruence at a time:
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. .
Plan. Split into and , and use that and share no factor.
Step 1. Modulo 8. . The numbers and are coprime, so all of goes into one of them: or . The same holds modulo .
Step 2. Four pairs. The pairs and give and .
Step 3. and . Try : , so , . So .
Step 4. and . This is , since and swap the two roles.
Check. and . Both end in themselves.
Answer: solutions: , , and .
What if? Modulo there are always exactly four solutions, and the two non-trivial ones always add up to .
Log in to join the discussion.
Loading…