Ask your own question, for FREE!
Mathematics
OpenStudy (anonymous):

Best Algorithm to find Prime numbers. Best Algorithm to find Prime numbers. @Mathematics

8 years ago
OpenStudy (anonymous):

You're asking a question which has no definitive answer. The only one I'm familiar with is the Sieve of Eratosthenes, but even that one will only get you up to the millions. Anything larger and it gets increasingly difficult.

8 years ago
OpenStudy (anonymous):

In Italy we call it Crivello di Eratostene, it tells you if a number is a prime number or not, it's very easy to understand: You try to divide the number for every integer before it (besides the number you are checking and 1), if any division has a integer as result, your number is not prime.

8 years ago
OpenStudy (anonymous):

I have tried the Sieve of Eratosthenes, but i want more fast algorithm.

8 years ago
OpenStudy (anonymous):

Have you tried the Sieve of Atkin? It's a modified Eratosthenes' one and should work faster.

8 years ago
OpenStudy (anonymous):

nop, i will try it. Thanks.

8 years ago
Can't find your answer? Make a FREE account and ask your own question, OR you can help others and earn volunteer hours!