Regarding; Lowest exponent of k such that b^k mod n = b^(n-1) mod n Jon Perry perry at globalnet.co.uk http://www.users.globalnet.co.uk/~perry/maths/ http://www.users.globalnet.co.uk/~perry/DIVMenu/ BrainBench MVP for HTML and JavaScript http://www.brainbench.com