Computing prime factors may sound like an elementary math problem, but try it with a large number, say one that contains more than 600 digits, and the task becomes enormously challenging and ...

This is a preview. Log in through your library . Abstract If $a$ is not a multiple of $n$ and $a^{n - 1} \not\equiv 1 \operatorname{mod} n$, then $n$ must be ...