Re: Q:About primes?
- From: Phil Carmody <thefatphil_demunged@xxxxxxxxxxx>
- Date: 06 Jan 2006 13:05:34 +0200
Dan <30pack@xxxxxxxxxxxxx> writes:
> Q:About primes?
>
> Why does a certain large prime require much more
> processing time to verify its primality than one that
> is more than 60 times its size?
>
> e.g.
>
> This prime below with 749 digits required 17+ hours to
> establish its primality.
>
....
>
> Whereas this prime below with 751 digits that is more
> than 60 times the size of the above prime
What on earth are you gibbering on about?
A 751-digit prime is roughly 1.0026 times the size of a 749-digit number.
Phil
--
What is it: is man only a blunder of God, or God only a blunder of man?
-- Friedrich Nietzsche (1844-1900), The Twilight of the Gods
.
- Follow-Ups:
- Re: Q:About primes?
- From: Joseph Fagan
- Re: Q:About primes?
- References:
- Q:About primes?
- From: Dan
- Q:About primes?
- Prev by Date: subdifferential's of convex function
- Next by Date: Re: Books on eigenvectors
- Previous by thread: Re: Q:About primes?
- Next by thread: Re: Q:About primes?
- Index(es):