Re: [boost] Re: Re: Compile time prime numbers, powers and roots

From: Stephen Nutt (snutt_at_[hidden])
Date: 2003-09-18 21:27:20

Reid

Thanks for the info.  Sounds like a project for the weekend if I can find a
copy.  Only have "Sorting and Searching" at home.

Stephen

> <snipped>
>
> Knuth pretty well beats the problem to death in the "Seminumerical
> Algorithms" volume of "The Art of Computer Programming."  He gives several
> algorithmic improvements on Fermat's formula, and discusses how to work
with
> larger numbers using continued fractions.  I'll refrain from quoting any
of
> it, as it's quite extensive and messy, and everyone's got a copy anyway,
> right? <g>.
>
> Reid Sweatman
>
>
> _______________________________________________
> Unsubscribe & other changes:
http://lists.boost.org/mailman/listinfo.cgi/boost