Groups > comp.soft-sys.math.maple > #1207

Re: Checking primality of large numbers

Newsgroups	comp.soft-sys.math.maple
Date	2015-11-04 11:28 -0800
References	<d9uii3Fd8c9U1@mid.individual.net>
Message-ID	<efbca785-847c-4bba-a122-af6595061a78@googlegroups.com> (permalink)
Subject	Re: Checking primality of large numbers
From	Peter Luschny <peter.luschny@gmail.com>

Show all headers | View raw

Am Mittwoch, 4. November 2015 15:20:53 UTC+1 schrieb RR:

> For a problem in recreational math I am testing numbers of
> magnitude around 10^1400 whether they are prime or not.
> It takes about two and half an hour per number when I use
> the standard isprime() Funktion.
> 
> Are there ways inside Maple (I use V) to get the results faster?

Well, if your computer is as old as Maple V (which is from the 
last millennium) you probably have no chance to speed this up.

With an Intel i7-2600 3.4GHz, a nice OS like Linux 64-bit and
free software like Primo this takes about 10 minutes.

Back to comp.soft-sys.math.maple | Previous | Next — Previous in thread | Find similar

Thread

Checking primality of large numbers Rainer Rosenthal <r.rosenthal@web.de> - 2015-11-04 15:20 +0100
  Re: Checking primality of large numbers William Unruh <unruh@invalid.ca> - 2015-11-04 17:34 +0000
    Re: Checking primality of large numbers William Unruh <unruh@invalid.ca> - 2015-11-04 18:27 +0000
  Re: Checking primality of large numbers Peter Luschny <peter.luschny@gmail.com> - 2015-11-04 11:28 -0800

csiph-web