> So the sqaure performs in O(n) time. Plus, you could already throw in the
> sub 2 by starting at -1 instead of 1. And figuring out the mod is just as
> easy.
Yes, the runtime is proportional to some number, but that number is *not*
the number of digits (as n usually means)! It is the number we are squaring!
Unfortunatly, this would be quite inefficient compared even with traditional
multiplying techniques.
-Lucas
_________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
