Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-oxford/2021/prelims/mathematics-iv/7/a/solution

The greatest common divisor of and is , which divides . Divide the linear Diophantine equation by to obtain
Reducing modulo gives , so . Substitution gives the complete family of integer solutions
Every such pair satisfies the equation, and every solution must have this residue for , so none are omitted. Positivity requires and . For integer these are exactly . Thus the pairs with both entries positive are

New to topics? Read the docs here!