[plt-scheme] fast primality testing

From: Joshua Zucker (joshua.zucker at gmail.com)
Date: Wed Jul 6 23:19:49 EDT 2005

I'm playing around with a problem from Al Zimmerman's Programming Contest,
not really to try to win the contest, but just to have an excuse to
teach myself some more scheme.

One part I'm not really interested in teaching myself, though: is
there a reasonably fast primality-checker in some library somewhere?
No big requirements here: it just has to operate to return true or
false, pretty fast, for numbers up to 17 digits.

--Joshua Zucker

Posted on the users mailing list.