Euclid's lemma
Euclid's lemma states that if a prime divides a product of integers, it divides at least one factor. It underpins the uniqueness of prime factorization.
Euclid's lemma states that if a prime divides a product of integers, it divides at least one factor. It underpins the uniqueness of prime factorization.