Euclid's lemma tells us that if p is a prime number and p divides ab, then p divides a orp divides b. Use Euclid's lemma
Posted: Thu May 12, 2022 11:13 am
This is for a discrete mathematics course. If you can explain in
paragraph form the best you can that'd be great! I will rate
up if problem is attempted correctly. Thank you!!
Euclid's lemma tells us that if p is a prime number and p divides ab, then p divides a orp divides b. Use Euclid's lemma to prove (by contradiction), that 3 is irrational.
paragraph form the best you can that'd be great! I will rate
up if problem is attempted correctly. Thank you!!
Euclid's lemma tells us that if p is a prime number and p divides ab, then p divides a orp divides b. Use Euclid's lemma to prove (by contradiction), that 3 is irrational.