Show that n is even for all n 2SolutionWe have that n divid

Show that (n) is even for all n > 2.

Solution

We have that (n) divides n/p, p>2 prime, whenever n/p is an integer. This then implies that n=kp(n), where kZ+. So, p2.

This shows the given statement.