unbent@ecsvax.UUCP (11/27/84)
==>
My colleague Paul Ziff thanks the many respondants for their
information on palindromic primes. He found a nine-digit one on his own
several days after my last posting and wishes to share it with you, since
it's especially pretty:
100030001
Now his next questions: Is 1111111111111111111 [19 ones] a prime?
(He believes it to be the first iterative prime after 11.) How about
11111111111111111111111 [23 ones]? These questions may seem trivial to you
Cray-drivers out there, 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.)
Thanks in advance for the answers (which I'll pass along to him).
--Jay Rosenberg ...{decvax,akgua}!mcnc!ecsvax!unbent
=========================================================================
Dept. of Philosophy; University of North Carolina; Chapel Hill, NC 27514
=========================================================================gjk@talcott.UUCP (Greg J Kuperberg) (11/29/84)
> ...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