Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/3/84; site talcott.UUCP
Path: utzoo!watmath!clyde!bonnie!akgua!whuxlm!harpo!decvax!genrad!wjh12!talcott!gjk
From: gjk@talcott.UUCP (Greg J Kuperberg)
Newsgroups: net.math
Subject: Re: palindromic primes -- 2nd time around (new questions)
Message-ID: <141@talcott.UUCP>
Date: Thu, 29-Nov-84 13:30:40 EST
Article-I.D.: talcott.141
Posted: Thu Nov 29 13:30:40 1984
Date-Received: Sun, 2-Dec-84 02:43:20 EST
References: <3498@ecsvax.UUCP>
Organization: Harvard
Lines: 14

> ...but poor Paul is pursuing his hobby on an *Osborne*.
> (He loads up his factorization program, starts it running, opens the disk
> drive doors for cooling, and leaves the thing on over night.)
...
> --Jay Rosenberg                      ...{decvax,akgua}!mcnc!ecsvax!unbent

Factorization?  I think that that's not a good idea.  How about
Fermat's Little Theorem?  It's decisive 99.99% of the time (and very easy
to implement).
---
			Greg Kuperberg
		     harvard!talcott!gjk

"Eureka!" -Archimedes