Euclid's Lemma for Prime Divisors/Examples/6

From ProofWiki
Jump to navigation Jump to search

Example of Use of Euclid's Lemma for Prime Divisors

Note that Euclid's Lemma for Prime Divisors does not hold for composite numbers.

For example:

$6 \divides 12 = 3 \times 4$

but:

$6 \nmid 3$ and $6 \nmid 4$


Sources