Euclid's Lemma for Prime Divisors/Examples

From ProofWiki
Jump to navigation Jump to search

Examples of Use of Euclid's Lemma for Prime Divisors

Example: $6$

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$