pub fn n_order(a: &Integer, n: &Integer) -> Result<Integer, Error>
Returns the order of a modulo n.
a
n
The order of a modulo n is the smallest integer k such that a**k leaves a remainder of 1 with n.
k
a**k