Primeseasy
0:00.0
If a prime number divides the product of two integers and (written as ), what does Euclid's Lemma guarantee?
If a prime number divides the product of two integers and (written as ), what does Euclid's Lemma guarantee?
If a prime number divides the product of two integers and (written as ), what does Euclid's Lemma guarantee?