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

[Sam Staton]

Well, to get a mod m you might need to remember that mod means remainder.

just do

a divided by m

Chop of the integer part (read it on the screen up to the decimal point,
say b, then do 'minus b')

Multiply by m

voila

-- 
sam



On Fri, 31 May 2002, Timothy Hospedales wrote:

>
> > > 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 :)
>
>
> _______________________________________________
> CST-2 mailing list
> CST-2@srcf.ucam.org
> http://www.srcf.ucam.org/mailman/listinfo/cst-2
>