Statements (22)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:alsoKnownAs |
gptkb:Sieve_of_Eratosthenes
|
| gptkbp:category |
prime number algorithms
|
| gptkbp:complexity |
O(n log log n)
|
| gptkbp:field |
gptkb:mathematics
number theory |
| gptkbp:firstDescribed |
3rd century BC
|
| https://www.w3.org/2000/01/rdf-schema#label |
Eratosthenes sieve
|
| gptkbp:input |
integer n
|
| gptkbp:method |
iterative marking of multiples
|
| gptkbp:namedAfter |
gptkb:Eratosthenes
|
| gptkbp:output |
all primes less than or equal to n
|
| gptkbp:purpose |
finding prime numbers
|
| gptkbp:relatedTo |
gptkb:Atkin_sieve
prime number sieve trial division |
| gptkbp:type |
ancient algorithm
|
| gptkbp:usedIn |
cryptography
computational number theory |
| gptkbp:bfsParent |
gptkb:Brun_sieve
gptkb:combinatorial_sieve |
| gptkbp:bfsLayer |
7
|