Efficiency of Sieve vs. Derivative Method for Primality Testing

  • Context:
  • Thread starter Thread starter Hugo1177
  • Start date Start date
  • Tags Tags
    Formula Test
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
Sign up Log in
3 replies · 3K views
Hugo1177
Messages
2
Reaction score
0
We can determinate if one number is prime with the modulo operation.
https://www.researchgate.net/publication/346647223_Primality_Test_Formula
 

Discussion

Mathematics news on Phys.org
Hugo1177 said:
We can determinate if one number is prime with the modulo operation.
https://www.researchgate.net/publication/346647223_Primality_Test_Formula
Interesting. However I find the usual sieve of Erastothenes to be simpler and less time consuming. (I believe that the two methods are related to each other anyway.)

-Dan
 
I am not an expert in computational time, are you sure that the sieve is better for big numbers? I hear that there aren´t a efficient form to determinate if a number is prime or not in polynomial time. Here you only have to do the 30th or 40th derivative and divide one number relatively big by other
 
Hugo1177 said:
I am not an expert in computational time, are you sure that the sieve is better for big numbers? I hear that there aren´t a efficient form to determinate if a number is prime or not in polynomial time. Here you only have to do the 30th or 40th derivative and divide one number relatively big by other
I'm not an expert either. I'm simply guessing that taking derivatives is more time consuming than doing the sieve. I admit I may be wrong.

-Dan