Timeline for computing number of primes with congruence constraint
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 7, 2018 at 21:08 | comment | added | Igor Rivin | @Lucia Yes, I am thinking of fixed $a.$ How much precision would be needed for the zeros? And without congruence conditions, is the explicit formula faster (theoretically or practically)than Meissel-Lehmer? | |
| Feb 7, 2018 at 21:05 | comment | added | Lucia | Are you thinking of $a$ fixed, and $M$ large? Computing via the explicit formula and finding zeros of $L$-functions, would seem a good way to me -- would have complexity about $a M^{1/2+\epsilon}$. | |
| Feb 7, 2018 at 20:52 | history | asked | Igor Rivin | CC BY-SA 3.0 |