I'm asked to prove this lemma using the fundamental theorem of arithmetic:
Suppose and is prime. If then or .
I understand how to prove this using normal methods. (Contradiction seems straightforward.) However, I've read the definition of the fundamental theorem of arithmetic on wikipedia, and am stuck on how to use it to prove the statement.
Math Help Forum is a community of maths forums with an emphasis on maths help in all levels of mathematics. Register to post your math questions or just hang out and try some of our math games or visit the arcade.