Hi everybody. Show that for some positive integer is composite iff . Thanks.
Follow Math Help Forum on Facebook and Google+
Hi Fernando, Try thinking about what is when is not composite (i.e. it is either prime or 1). - Hollywood
Thanks, the proof is by contradiction, is it not? Thanks for your suggestion.
Originally Posted by Fernando Hi everybody. Show that for some positive integer is composite iff . Thanks. where r is the number of distinct prime factors of n .
View Tag Cloud