0

Let $d=(m,n)$, then for any $q,r \in \mathbb{Z}$ there is a $k \in \mathbb{Z}$ such that $kd=mq+nr$

This is a small conjecture I believe to be true. On Group Theory class we were asked to calculate the subgroups $HK$ of $\mathbb{Z}$, were $H=mZ$ and $K=nZ$. I decided to solve the problem by considering 3 cases:

  1. ($m=nq$ for some $q \in \mathbb{Z}$) or ($n=mt$ for some $t \in \mathbb{Z}$)

  2. $(m,n)$=1

  3. None of the conditions on 1) is satisfied and $(m,n)>1$.

The case I'm stuck at is 3). I found it easy to prove that $d\mathbb{Z} \subset (n\mathbb{Z})(m\mathbb{Z})$. I struggle to prove that $(n\mathbb{Z})(m\mathbb{Z}) \subset d\mathbb{Z}$. In order to prove this last part I think my conjecture is key.

Is there any elementary result in Number Theory that I'm missing in order to prove this?

Bill Dubuque
  • 272,048
Blue
  • 293
  • 1
  • 8

1 Answers1

3

Since $d = (m, n)$, we know $m = dx$ and $n = dy $, for some $x, y \in \mathbb{Z}$.

Then $mq + nr = (dx)q + (dy)r = d(xq + yr)$. Setting $xq + yr = k$, the result is proven.

ani
  • 54