MathDB
N divides phi(p^n-1)

Source: friend

December 12, 2005
Eulernumber theory proposednumber theory

Problem Statement

Maybe well known: pp a prime number, nn an integer. Prove that nn divides ϕ(pn1)\phi(p^n-1) where ϕ(x)\phi(x) is the Euler function.