It was really close, perhaps the ways you can wright n on is(adsbygoogle = window.adsbygoogle || []).push({}); >= the n-1:th prime. But how could i ever prove it?

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

Join Physics Forums Today!

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

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

# The way of finding primes

Loading...

Similar Threads - finding primes | Date |
---|---|

Finding all prime solutions | Feb 23, 2013 |

Find a prime divisor of 1111 (13 1's) | Oct 30, 2011 |

Is there any way to find the product of prime numbers? | Sep 4, 2011 |

Finding Primes: A Divisor summatory function | Jul 18, 2011 |

Find and Test Primes using the Chinese Remainder Theorem and Binary Search | Sep 20, 2010 |

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