Re: Q:About primes?
- From: "Joseph Fagan" <noemailplease@xxxxxxxxxx>
- Date: Fri, 6 Jan 2006 11:39:52 +0000 (UTC)
"Phil Carmody" <thefatphil_demunged@xxxxxxxxxxx> wrote in message
news:87irsxk45d.fsf@xxxxxxxxxxxxxxxxxxxxxxx
> 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
Eh?
10^751 / 10^749 = 10^2
Joe
.
- Follow-Ups:
- Re: Q:About primes?
- From: Pubkeybreaker
- Re: Q:About primes?
- From: Phil Carmody
- Re: Q:About primes?
- References:
- Q:About primes?
- From: Dan
- Re: Q:About primes?
- From: Phil Carmody
- Q:About primes?
- Prev by Date: Re: Integer solutions
- Next by Date: Re: Asymptote from a set of data
- Previous by thread: Re: Q:About primes?
- Next by thread: Re: Q:About primes?
- Index(es):