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.
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
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
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
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!