Bertrand's Primes – codegolf.stackexchange.com

Bertrand's Postulate states that for every integer n ≥ 1 there is at least one prime p such that n < p ≤ 2n. In order to verify this theorm for n < 4000 ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

Google Facebook Twitter More

• Digg
• Linkedin
• Stumbleupon
• Delicious
• Tumblr
• BufferApp
• Pocket
• Evernote

Unknown