How can I use Euclid's lemma to prove that if \(p\) is a prime number with \(1\leq k

Mathematics

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

Euclid's lemma states that if \(p|ab\), then \(p|a\) and/or \(p|b\).

Do you want me to show you what I have so far?

surely p! (in the numerator) is ALWAYS divisible by p?

Looking for something else?

Not the answer you are looking for? Search for more explanations.