[CST-2] advanced algorithms 1996/9/6 (fwd)

Timothy Hospedales tmh31@cam.ac.uk
Fri, 31 May 2002 21:55:27 +0100


> > Then just square k times and you get for a=12, a^(n-1)=1.
> 1 mod 65 I mean ..

 Erm, yes. But the calculators we can use dont have a mod button that
I can find :)