Using the sieve of Eratosthenes to obtain successive prime numbers with the aid of the integer part function (Q2713271)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1595634
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Using the sieve of Eratosthenes to obtain successive prime numbers with the aid of the integer part function |
scientific article; zbMATH DE number 1595634 |
Statements
21 June 2001
0 references
sieve of Eratosthenes
0 references
formulas for prime numbers
0 references
Using the sieve of Eratosthenes to obtain successive prime numbers with the aid of the integer part function (English)
0 references
The paper attempts to give a formula for the \(n\)-th prime by way of utilizing the sieve of Eratosthenes. This hard-to-write formula has only a formal value as such, for it is more of an algorithm for listing the successive prime integers, the task that all sieves do in various ways.
0 references
0.7569876313209534
0 references
0.729164183139801
0 references
