I want to show that if p | $a^{e}-1$ then also p | $a^{ek}-1$ where k is any integer.
Def. of order in terms of divisibility: Let $m ≥ 2$ and a be any integer coprime to $m$. The order of $a$ mod $m$ is the smallest $e > 0$ so that $m$ divides $a^{e}-1$.
In terms of congruence I can see why this is the case: e.g. let $a = 2, e = 4, m = 5$. Then
$2^{4} ≡ 1 $ (mod $5$), lets scale $e$ with $k=2$, then $2^{4^2} ≡ 1 $ (mod $5$) = $2^{4}2^{4} ≡ 1 $ (mod $5$). So it does not matter what $k$ is, the congruence is still valid.
I don't know exactly how to show why the scaling of $e$ with any $k$ does not change the fact that $p$ divides $a^{e}-1$.