Prime Numbers: Difference between revisions
From charlesreid1
| Line 14: | Line 14: | ||
{{Main|Segmented Sieve}} | {{Main|Segmented Sieve}} | ||
A segmented prime number sieve is an algorithm that can search for prime numbers that fall in a segmented range (finding prime numbers between M and N). | |||
==Python== | ==Python== | ||
Revision as of 18:14, 29 March 2026
List of Prime Numbers
A really big list of all the prime numbers less than 1 million: Prime Numbers/List
Computing Prime Numbers
Sieve of Eratosthenes
The Sieve of Eratosthenes is the most common algorithm for finding prime numbers below a certain value N.
Segmented Sieve
A segmented prime number sieve is an algorithm that can search for prime numbers that fall in a segmented range (finding prime numbers between M and N).
Python
Java
Flags
 |
Mathematical Constants
Irrational Numbers: Euler-Mascheroni Constant · Sqrt2 · Phi · Sqrt3 · e · Sqrt5 · Sqrt6 · Sqrt7 · Sqrt8 · Pi · Sqrt10 · Sqrt11 · Pi to the Pi Prime Numbers: Prime Numbers · Palindromic Primes · Prime Generating Polynomials · Belphegors Prime Sequences: Fibonacci Numbers · Lucas Numbers · General Fibonacci Numbers Number Forms: Fermat Numbers · Mersenne Primes · Counting and Combinatorics: Catalan Numbers · Shannon Number · Eddington Number Tetration and Knuth's Up Notation: Tetration Factoring and Number Theory: Divisibility · Totient Function Games: Four Fours · Five Fives
|