Timeline for Upper bound on sum of Lambda(n) over short interval
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 31, 2023 at 10:39 | comment | added | H A Helfgott | I've said "Brun-Titchmarsh". Of course that has $\pi(x+y) - \pi(x) \leq 2 \frac{y}{\log y}$ as a special case! | |
| Dec 31, 2023 at 9:18 | comment | added | Daniel Weber | From the comments on that answer there's a known $\pi(x+y) - \pi(x) \leq 2\frac{y}{\log y}$, is that strong enough? There's some error introduced by prime powers, but it might be negligible. | |
| Dec 31, 2023 at 8:56 | comment | added | H A Helfgott | @CommandMaster Proving matters oneself as in Brun-Titchmarsh (sieve) would seem to make more sense. It just seems very unlikely that it hasn't been done already. | |
| Dec 31, 2023 at 5:04 | comment | added | Daniel Weber | mathoverflow.net/questions/235463/… seems relevant. Does partial summation introduce too much error? | |
| Dec 31, 2023 at 4:56 | comment | added | H A Helfgott | It would be best if $y$ could be allowed to be arbitrarily small (just as in Brun-Titchmarsh). | |
| Dec 31, 2023 at 4:52 | comment | added | Daniel Weber | How small is your $y$ compared to $x$? | |
| Dec 31, 2023 at 4:38 | history | asked | H A Helfgott | CC BY-SA 4.0 |