You are Here: Home >< Maths

# proof question help watch

1. Prove that n|φ(a^n-1) for every integer a≥2 and any positive integer

anyone know how to prove it?
thank you
2. (Original post by koukou)
Prove that n|φ(a^n-1) for every integer a≥2 and any positive integer

anyone know how to prove it?
thank you
what does that stand for
3. (Original post by rbnphlp)
what does that stand for
See here.

I think this can be proved with Zsigmondy's theorem, but I'm not sure.
4. (Original post by koukou)
Prove that n|φ(a^n-1) for every integer a≥2 and any positive integer

anyone know how to prove it?
thank you
I believe this requires some group theory (particularly Lagrange's theorem) but I may be wrong.
5. (Original post by GHOSH-5)
See here.

I think this can be proved with Zsigmondy's theorem, but I'm not sure.
thanks..

TSR Support Team

We have a brilliant team of more than 60 Support Team members looking after discussions on The Student Room, helping to make it a fun, safe and useful place to hang out.

This forum is supported by:
Updated: October 11, 2009
Today on TSR

### University open days

• University of Roehampton
Sat, 17 Nov '18
• Edge Hill University
Faculty of Health and Social Care Undergraduate
Sat, 17 Nov '18
• Bournemouth University
Sat, 17 Nov '18
Poll
Useful resources

### Maths Forum posting guidelines

Not sure where to post? Read the updated guidelines here

### How to use LaTex

Writing equations the easy way

### Study habits of A* students

Top tips from students who have already aced their exams