Prove the following:

Prove the following:

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

that proves the contrapositive :
\(n\ne 2 \implies \phi(n)\not\equiv 1\pmod{2}\)

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.