--- djbroadhurst <d.broadhurst@...
> OK, Phil, your turn to teach, please.
> > half the speed of a primorial newpgen
> Please, sir, how does NewPgen economically solve
> k=1/(-m#) mod p
> No problem working out -m# mod p,
> but then how do you best find the modular inverse
> Is it just the obvious O(log(p)) Euclid job?
> In which case I can do it in Fortran, with line-numbering :-)
Yuppers. Fortran schmortran - do it in URL or Turing Machine. You
were aware that Fortran is as capable as a Turing machine, weren't
.sig selecter broken, please ignore.
Do You Yahoo!?
Yahoo! Sports - sign up for Fantasy Baseball