Primalty Test

[Cyclamen Persicum]

A 3000 digit long prime number is not a problem at all =))).
My comp has worked half an hour and gave me the following
10240-bit long primes:

0835h*2^10228 + 1
355Fh*2^10226 + 1
48F9h*2^10225 + 1
6E21h*2^10225 + 1
CC1Fh*2^10224 + 1

And of course, my prog is several times slower than others and does not use a sieve, just brute division with very slow DIV instruction =)))

[juergen]

Originally Posted by Cyclamen Persicum

A 3000 digit long prime number is not a problem at all =))).
My comp has worked half an hour and gave me the following
10240-bit long primes:

0835h*2^10228 + 1
355Fh*2^10226 + 1
48F9h*2^10225 + 1
6E21h*2^10225 + 1
CC1Fh*2^10224 + 1

And of course, my prog is several times slower than others and does not use a sieve, just brute division with very slow DIV instruction =)))

Can you really proof they are prime? Did you check for all the factors?
Why do you mix hex and decimal, btw?
What was the largest prime you found?
And sorry if it bores you, but I still would like to know what machine you are using.
I guess the hex number is a prime,, right?