If $k$ and $l$ are positive integers such that $k\mid l$, show that for every positive integer $m$, $1+(k+m)l$ and $1+ml$ are relatively prime.

Question

If $k$ and $l$ are positive integers such that $k\mid l$, show that for every positive integer $m$, $1+(k+m)l$ and $1+ml$ are relatively prime.

My approach: I wrote

$(k+m)(1+ml)-m(1+(k+m)l)=k=la$ where $a>0$

Now, I took both sides modulo $l$. The right side is $0 \pmod l$ whereas the left side is $k \pmod l$ Thus, $l\mid k$.

But $k\mid l$ by the question so, $k=l$ ... But then how to proceed?

I am confused how you obtained $k=la.$ Could you explain it? Thanks. — awllower, Apr 12 '16 at 15:21
Put $,a,b = ml,kl,$ in $,(1!+!a!+!b,1!+!a) = (b,1!+!a) = (b,1)=1,$ by $,b\mid a,$ and dupe. — Bill Dubuque, Jan 28 '24 at 00:50

score 2 · Accepted Answer · answered Apr 12 '16 at 15:35

We can employ of the fact that $\gcd(x, y)=\gcd(x+ny,y),\forall n\in\mathbb Z.$
So $\gcd(1+(k+m)l,1+ml)=\gcd(kl,1+ml).$ But $\gcd(kl,1+ml)\mid m(kl)-k(1+ml)=-k\mid l.$ Hence $\gcd(kl,1+ml)\mid 1+ml-ml=1.$
Hope this helps, and please inform me if you don't understand something, thanks.

score 0 · Answer 2 · answered Apr 12 '16 at 15:14

0

Suppose that $p$ is a prime with $p\mid 1+ml$ and $p\mid 1+kl+ml$. Then $p\mid kl$ and $p\mid l$ because of $k\mid l$. This contradicts $p\mid 1+ml$. Hence $gcd(1+ml,1+ml+kl)=1$.

answered Apr 12 '16 at 15:14

Dietrich Burde

130,978

It proves that the GCD cannot be prime.. but how to prove it will be $1$? – Apr 12 '16 at 15:16
1

It proves that no prime divides the gcd. Hence it is $1$. – Dietrich Burde Apr 12 '16 at 15:17

If $k$ and $l$ are positive integers such that $k\mid l$, show that for every positive integer $m$, $1+(k+m)l$ and $1+ml$ are relatively prime.

2 Answers2