Let be a number that is not a prime.

Show that there is a divisor of , with , so that

On my paper, I've written down n=rs where n and s are any natural numbers >1. Not sure if that's needed, though.

Printable View

- Nov 22nd 2007, 10:57 AMJoel24Prime numbers
Let be a number that is not a prime.

Show that there is a divisor of , with , so that

On my paper, I've written down n=rs where n and s are any natural numbers >1. Not sure if that's needed, though. - Nov 22nd 2007, 11:22 AMCaptainBlack
- Nov 22nd 2007, 11:29 AMJoel24
Ah, a proof (or sorts) by contradiction. I would've never have thought of that.

Excellent. Thank you so much!