Timeline for Is there a tighter bound than $\alpha=4$ in $ \prod_{i=1}^n p_i < \alpha^{p_n} $?
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| Sep 20, 2016 at 15:42 | vote | accept | Mark Fischler | ||
| S Sep 19, 2016 at 23:20 | history | suggested | CommunityBot | CC BY-SA 3.0 |
Corrected typos.
|
| Sep 19, 2016 at 23:13 | review | Suggested edits | |||
| S Sep 19, 2016 at 23:20 | |||||
| Sep 19, 2016 at 21:57 | comment | added | abx | Bertrand, not Bertram. | |
| Sep 19, 2016 at 21:52 | history | edited | GH from MO |
edited tags
|
|
| Sep 19, 2016 at 21:44 | comment | added | Gerhard Paseman | While your question regarding this aspect of prime numbers is fairly basic and well known to students of analytic number theory (and so this forum is not as good a place for your question as is math.stackexchange), something that may not be known is the following, which would be a good question for this forum: If $\alpha^{p_n}$ is replaced by $\alpha^{p_{n+1}}$ in your display above, is $e$ a strict upper bound for $\alpha$ for all $n$? Gerhard "Likes This Version For MathOverflow" Paseman, 2016.09.19. | |
| Sep 19, 2016 at 21:34 | answer | added | Fedor Petrov | timeline score: 1 | |
| Sep 19, 2016 at 21:34 | answer | added | GH from MO | timeline score: 10 | |
| Sep 19, 2016 at 21:32 | comment | added | Gerhard Paseman | Look up Chebyshev functions ($\sum_p \log p$ for $p$ running over primes less than $x$). You will find $e$ is a near miss but provably an asymptotic value for your $\alpha$. Gerhard "For Some Value Of 'Provably'" Paseman, 2016.09.19. | |
| Sep 19, 2016 at 21:18 | history | asked | Mark Fischler | CC BY-SA 3.0 |