Timeline for Sum of inverse squares of numbers divisible only by primes in the kernel of a quadratic character
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 28, 2021 at 9:09 | vote | accept | bean | ||
| Feb 25, 2021 at 19:01 | comment | added | bean | I have been doing this programmatically for now, but right now for a lower bound I'm truncating the product for $p \leq x$ and for an upper bound I'm starting at $\zeta(2)$ and removing $p \leq x$ for which $\chi(p) \neq 1$. If I understood right, yours converges much faster. | |
| Feb 25, 2021 at 18:59 | comment | added | bean | To make sure I understand, the point is that there are closed forms for $L(k)$ and $P(2k)$ goes to $1$ pretty rapidly as $k$ gets large, so with a program (or a lot of paper) we could get an arbitrarily tight numerical approximation, right? | |
| Feb 25, 2021 at 11:45 | history | answered | Henri Cohen | CC BY-SA 4.0 |