I am trying to find the best algorithm that will find the prime numbers just for fun..(adsbygoogle = window.adsbygoogle || []).push({});

I am not a programmer so lets talk here in english please..

For example ;

- For the algorithm to run faster it must not calculate even numbers.

a = 1

a = a + 2

the number that will be searched should increase like that..

- The number must first be divided by five..If the result is an integer the program should ignore the rest of the calculations..and return to a = a + 2

so that it can try a new number..

Any more ideas that can speed things up?

**Physics Forums - The Fusion of Science and Community**

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Prime Number finding Algorithm.How can we make things go faster?

Loading...

Similar Threads - Prime Number finding | Date |
---|---|

B Simple Question About Term(s) re: Fermat | Jan 19, 2018 |

I Pi(x) from zeta | Jan 8, 2018 |

A Examples of fractal structure in prime partition numbers? | Jan 4, 2018 |

B Prime Factorization of 5-Digit Numbers | May 29, 2017 |

B Factoring a number and prime numbers? | Apr 20, 2017 |

**Physics Forums - The Fusion of Science and Community**