Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:category |
ancient algorithms
prime number algorithms |
| gptkbp:complexity |
O(n log log n)
|
| gptkbp:field |
gptkb:mathematics
number theory |
| gptkbp:firstDescribed |
3rd century BC
|
| gptkbp:input |
integer n
|
| gptkbp:introducedIn |
gptkb:ancient_Greece
|
| gptkbp:method |
iterative removal of multiples
|
| gptkbp:namedAfter |
gptkb:Eratosthenes
|
| gptkbp:output |
all prime numbers less than or equal to n
|
| gptkbp:purpose |
finding prime numbers
|
| gptkbp:relatedTo |
gptkb:Eratosthenes
gptkb:Prime_Number gptkb:prime_number_sieve |
| gptkbp:bfsParent |
gptkb:Eratosthenes
gptkb:Lehmer_sieve |
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
sieve of Eratosthenes
|