Timeline for Is there a $c > 1$ such that for all $n \ge 1$ the largest integer $\le c^n$ is prime?
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 21, 2022 at 20:36 | comment | added | user44143 | I clarified this to say "it [iterating the algorithm three million times] produces three values..."; you can see one of those values on the third-to-last line of the other answer. And yes, $\epsilon$ more than any of these would satisfy the same condition. | |
| Dec 21, 2022 at 20:36 | history | edited | user44143 | CC BY-SA 4.0 |
clarified and repunctuated
|
| Dec 21, 2022 at 20:08 | comment | added | YCor | "There are three values": but the set of $x$ with this condition (namely $\{x\in [41,42[\;:\forall i\in\{1,\dots,27\}:\lfloor x^i\rfloor$ is prime$\}$) is open on the right, so it's infinite as soon as it's empty. Do you mean it has three connected components? | |
| Dec 21, 2022 at 16:26 | history | answered | user44143 | CC BY-SA 4.0 |