Solving a linear Diophantine equation
Find all integer pairs satisfying . Every solution can be written as and for an arbitrary integer , where are the integers obtained when is taken to be its smallest positive value. What is ?
Show hints (2)+
- Reduce the equation modulo 3 to isolate a condition on alone.
- You get ; take the smallest positive as , then solve for .
Answer
Reveal answer →Final answer
3331
Want the full step-by-step worked solution? It's part of Premium - along with a worked solution for every question in the bank.
Asked at: Jane Street, Citadel