- #1
math_nerd
- 22
- 0
Prove that the Euler phi equation is always divisible by 2. If n > 2.?
I don't understand how this proof works:
I think I need to show that the inverse of a and a are both generated by the same group. Therefore, there are at least 2 elements that generate all other elements in the group. I'm stumped.
Please give a thorough explanation of steps.
I don't understand how this proof works:
I think I need to show that the inverse of a and a are both generated by the same group. Therefore, there are at least 2 elements that generate all other elements in the group. I'm stumped.
Please give a thorough explanation of steps.