Generating Prime Numbers -- A Fast New Method
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2019
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917695466766336 |
|---|---|
| author | Kamalappan, V. Vilfred |
| author_facet | Kamalappan, V. Vilfred |
| contents | Bertrand's Postulate ensures existence of prime $p$ between $n$ and $2n$, $n$ an integer $\geq 2$ and the sieve of Eratosthenes, a very simple ancient algorithm, generates all prime numbers up to any given limit. Combining the above two, in this paper, we provide a simple fast moving algorithm to generate prime numbers up to any given limit. We also discuss Riemann zeta function related to generating of prime numbers. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1904_11822 |
| institution | arXiv |
| publishDate | 2019 |
| record_format | arxiv |
| spellingShingle | Generating Prime Numbers -- A Fast New Method Kamalappan, V. Vilfred General Mathematics 11A41, 11A51 Bertrand's Postulate ensures existence of prime $p$ between $n$ and $2n$, $n$ an integer $\geq 2$ and the sieve of Eratosthenes, a very simple ancient algorithm, generates all prime numbers up to any given limit. Combining the above two, in this paper, we provide a simple fast moving algorithm to generate prime numbers up to any given limit. We also discuss Riemann zeta function related to generating of prime numbers. |
| title | Generating Prime Numbers -- A Fast New Method |
| topic | General Mathematics 11A41, 11A51 |
| url | https://arxiv.org/abs/1904.11822 |