Timeline for Constant $a$ such that $[a^n]$ is always prime for $n\in N^+$
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 24, 2017 at 23:40 | vote | accept | Milin | ||
| Aug 24, 2017 at 15:30 | answer | added | user41593 | timeline score: 2 | |
| Aug 24, 2017 at 14:59 | comment | added | KConrad | As Sylvin Julien points out in an answer, the prime-producing formula is doubly exponential: $[a^{3^n}]$ (or $[a^{c^n}]$) for all $n$. It is a curiosity but I would not call it an interesting theorem because the proof shows it's a rigged formula: you need to use primes to get the formula and it's totally unrealistic to think there is some independent way to describe the number $a$ without using primes. It's uselessness is similar in spirit to the "formula" for counting primes in math.stackexchange.com/questions/776997/…. | |
| Aug 24, 2017 at 14:42 | answer | added | Sylvain JULIEN | timeline score: 6 | |
| Aug 24, 2017 at 14:33 | history | edited | Milin | CC BY-SA 3.0 |
added 1 character in body
|
| Aug 24, 2017 at 14:27 | history | asked | Milin | CC BY-SA 3.0 |