[Top][All Lists]

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Gcl-devel] Re: large primes

From: Paul F. Dietz
Subject: Re: [Gcl-devel] Re: large primes
Date: Fri, 03 Jun 2005 06:33:08 -0500
User-agent: Mozilla/5.0 (X11; U; Linux i686; en-US; rv:1.7.8) Gecko/20050511

Robert Boyer <address@hidden> writes:

According to one place on the web
(http://primes.utm.edu/primes/search.php?Number=100) the largest known
prime is:

 (- (expt 2 25964951) 1)

GCL can compute this (in a rather long 7 seconds), but then causes a
segmentation fault trying to print it.

There's been some work recently printing large bignums in SBCL.
The naive algorithm they had been using ran out of memory, so IIUC
they went to a divide-and-conquer algorithm.


reply via email to

[Prev in Thread] Current Thread [Next in Thread]