# How to prove that the Euler $\phi(n)$ function is even for all $n>2$? [duplicate]

In chapter 11 of Contemporary Abstract Algebra I learned Lagrange theorem:

If $G$ is a finite group and $H$ is a subgroup of G, then $|H|$ divides $|G|$

and one of its corollaries:

In a finite group, the order of each element of the group divides the order of the group

In the exercise I've been asked to prove, using that corollary, that the order of the multiplicative group of integers modulo $n$ is even when $n>2$. Or in other words, that the Euler $\phi(n)$ is even for all $n>2$.

I've seen some proofs of that claim but non are based on that corollary. How can I prove that using the corollary above?

## marked as duplicate by Tobias Kildetoft, Henning Makholm, DonAntonio group-theory StackExchange.ready(function() { if (StackExchange.options.isMobile) return; $('.dupe-hammer-message-hover:not(.hover-bound)').each(function() { var$hover = $(this).addClass('hover-bound'),$msg = $hover.siblings('.dupe-hammer-message');$hover.hover( function() { $hover.showInfoMessage('', { messageElement:$msg.clone().show(), transient: false, position: { my: 'bottom left', at: 'top center', offsetTop: -7 }, dismissable: false, relativeToBody: true }); }, function() { StackExchange.helpers.removeMessages(); } ); }); }); Sep 28 '16 at 10:51

If $n>2$ then $\pm 1$ are not congruent mod $n$.
Consider the group $G = (\mathbb{Z}/n\mathbb{Z})^{\times}$ of integers mod $n$. We have an obvious subgroup $H = \{\pm 1\}$ and so by Lagrange we must have $|H| = 2$ divides $|G| = \phi(n)$.