For the equation $b^k\equiv 1 \pmod p$, where $p$ is prime, how do I find a lower bound for $p$ such that $k$ will never be smaller than a given number, no matter how large $p$ gets?
Multiplicative order bounds
0
$\begingroup$
number-theory
modular-arithmetic