We know that (Characterization of prime number) $p \mid ab \Rightarrow p \mid a$ or $p \mid b$, where $p$ is prime number. How you prove that $p^2 \mid m$ and $p^2 \mid n \Rightarrow p^2 \mid mn$?
How you prove that $p^2 \mid m$ and $p^2 \mid n \Rightarrow p^2 \mid mn$?
0
$\begingroup$
elementary-number-theory
-
0you probably meant $p\vert m$ and $p\vert n$. – 2012-06-17
3 Answers
1
For any integers $a$, $b$, and $c$ whatsoever, if $a\mid b$, then $a\mid bc$. This is because if $b=ka$ for some $k\in\mathbb{Z}$, then we obviously have $bc=(kc)a$.
Letting $a=p^2$ and either $b=m$, $c=n$ or $b=n$, $c=m$ produces your claim.
2
$m=ap^2$, $n=bp^2$, $mn=abp^4$,
$ p^2\mid p^4$
Note that also $p^4\mid mn$
2
You surely do not mean to ask this, since if $p^2$ divides $m$, then automatically $p^2$ divides $mn$, whether or not $p$ is prime.