Timeline for Lower bound for $\prod_{p\equiv 3 \pmod 4} p^{v_p(n!)}$
Current License: CC BY-SA 4.0
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Aug 6, 2019 at 8:18 | history | edited | Greg Martin | CC BY-SA 4.0 |
added 444 characters in body
|
Aug 5, 2019 at 20:36 | comment | added | Kristiyan Vasilev | @GregMartin could you please explain the partial summation part in more detail? | |
Aug 1, 2019 at 16:49 | history | edited | Greg Martin | CC BY-SA 4.0 |
added 17 characters in body
|
Aug 1, 2019 at 16:47 | comment | added | Greg Martin | @FedorPetrov excellent observation and excellent diagnosis! I've corrected the error | |
Aug 1, 2019 at 10:16 | comment | added | Fedor Petrov | But our product does not exceed $\prod_p p^{\nu_p(n!)}=n!$, so its logarithm should not grow faster than $\log n!=n\log n+O(n)$. I guess your asymptotic formula for $\sum_{p\leqslant n, p=4k+3} \log p/p$ has to be corrected. | |
Jul 31, 2019 at 22:39 | history | answered | Greg Martin | CC BY-SA 4.0 |