0

I want to prove this by saying if 3 divides n and divides then then $8\times 3$ must divide $n$ which is 24, but that doesn't seem like a proof.
Or maybe a proof by contradiction that if 3 divides n and 8 divides n then 24 does not divide $n$, but that creates a contradiction because 3 and 8 divides $n$ so $3\times8$ must.

I'm hoping there's a theorem that says if $x$ and $y$ divide $n$ then $xy|n$

Gooby
  • 517

3 Answers3

2

$3\mid n\implies n=3k$ for some integer $k$.

$8\mid n\implies n=8l$ for some integer $l$.

Now note that $(8,3)=1$. This implies $\exists x,y \in \mathbb{Z}$ such that $$8x+3y=1$$.

Multiplying $n$ to both sides of the above equation we get, $$8nx+3ny=n$$ This implies $$8(3k)x+3(8l)y=n$$

I.e $24(kx+ly)=n$. As $k,x,l$ and $y$ are all integers, $24\mid n$.

1

This is a false statement, that $x|n, y|n\Rightarrow xy|n$. Counter example is $2|12, 4|12 $ but $8$ doesn't divide $12$.

Now, regarding your case, if $ x$ and $y$ divide $n$, then $n$ is a common multiple of both of them, but there must be a least element among the set of positive common multiples of $x$ and $y$. Let that least element be $k$. Then $n=kq+r$ for some $q$ and $r$ by division algorithm. Now, $x|k$ and $x|n\Rightarrow x|(n-kq)\Rightarrow x|r$. Similarly $y|r$. Bu then $r$ is a common multiple of $x$ and $y$, which is less than $k$. Hence, $r=0$ and $k|n$.

Alternatively, if you know group theory, define LCM of $x$ and $y$ to be the generator of intersection of groups generated by $x$ and $y$, i.e. if $x\mathbb Z\cap y\mathbb Z=k\mathbb Z$, define $lcm(x,y)=k$. Then all properties follow.

Martund
  • 14,826
  • 2
  • 14
  • 33
0

$8|n$ then $n=8k$;

$3|n$ then $3|8k$;

Euclid's lemma: $3|k$ or $3|8$;

Since $3 \not | 8$, it follows that $3|k$.

$k=3l$;

$n=8k=8(3l)=24l$.

Recall Euclid's lemma:

If a prime $p$ divides $ab$ then $p|a$ or $p|b$.

Peter Szilas
  • 21,123