Jon Perry schrieb: > > Regarding; > > Lowest exponent of k such that b^k mod n = b^(n-1) mod n > Hi Jon, did you ask for more explanation? Gottfried Helms