Printable View

Let be positive integer composite, squarefree Show that

Quote: Originally Posted by wauwau Let be positive integer composite, squarefree Show that For any natural integer , with primes, , we have that , so if , then n has to be divisible by a power of 2 greater than 1, and since then n is odd... Tonio