0

Let $gcd(a,b)=1$ and $k \in \{{0,1,2,..ab-a-b}\}$

Since $gcd(a,b)=1$, there exist integers $x$ and $y$ such that $ax+by=k$.

Dividing both sides by $a$ and re-arranging we get $k/a=b(y/a)+x$ , then $ 0\le x \lt b$ (by the division algorithm).

My problem is that I don't know if $(k/a)$ and $(y/a)$ are integers. If I knew that $(k/a)$ was an integer then $(y/a)$ would also be, because $gcd(a,b)=1$.

Is $k/a$ an integer?

Any tips, please?

Afonso
  • 5
  • See [Frobenius Coins](https://en.wikipedia.org/wiki/Coin_problem#:~:text=The%20coin%20problem%20(also%20referred,largest%20amount%20that%20cannot%20be) – lulu Nov 18 '23 at 20:06
  • I'm actually trying to prove the g formula for n=2, but this is the only thing that I'm missing for the complete proof – Afonso Nov 18 '23 at 20:11

0 Answers0