Solving a linear Diophantine equation

Find all integer pairs (x,y)(x, y) satisfying 3x+7y=100003x + 7y = 10000. Every solution can be written as x=a+7nx = a + 7n and y=b3ny = b - 3n for an arbitrary integer nn, where a,ba, b are the integers obtained when bb is taken to be its smallest positive value. What is aba \cdot b?

Show hints (2)+
  1. Reduce the equation modulo 3 to isolate a condition on yy alone.
  2. You get y1(mod3)y \equiv 1 \pmod 3; take the smallest positive yy as bb, then solve for x=ax = a.

Answer

Reveal 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

Related questions