A superpowered Euclidean prime generator
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2016
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916354105278464 |
|---|---|
| author | Wooley, Trevor D. |
| author_facet | Wooley, Trevor D. |
| contents | When $k>1$ and $n$ is the product of the smallest $k$ primes, the $(k+1)$-st smallest prime is the least divisor exceeding $1$ of $n^{n^n}-1$. This variant of Euclid's prime generator is discussed with some of its cousins. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1607_05267 |
| institution | arXiv |
| publishDate | 2016 |
| record_format | arxiv |
| spellingShingle | A superpowered Euclidean prime generator Wooley, Trevor D. Number Theory 11A41 When $k>1$ and $n$ is the product of the smallest $k$ primes, the $(k+1)$-st smallest prime is the least divisor exceeding $1$ of $n^{n^n}-1$. This variant of Euclid's prime generator is discussed with some of its cousins. |
| title | A superpowered Euclidean prime generator |
| topic | Number Theory 11A41 |
| url | https://arxiv.org/abs/1607.05267 |