Problem

Source: Romania TST 5 2009, Problem

Tags: modular arithmetic, number theory proposed, number theory



Let $a$ and $n$ be two integers greater than $1$. Prove that if $n$ divides $(a-1)^k$ for some integer $k\geq 2$, then $n$ also divides $a^{n-1}+a^{n-2}+\cdots+a+1$.