Timeline for Prime counting function estimate sieve of Eratosthenes-Legendre
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 11, 2019 at 18:42 | comment | added | Gerhard Paseman | Roughly, learners should start with math.stackexchange. While we don't card at the door, we hope people asking here on MathOverflow have more experience with manipulating O notation than appears in this post. The exponential term (4^stuff) comes from collecting the error terms of the product. (You might check out MathOveflow question 37679 for an older sieve argument.) Gerhard "Big Errors And Small Errors" Paseman, 2019.06.11. | |
| Jun 11, 2019 at 18:14 | comment | added | numbertheorylearner | @MarkWildon Thanks. I'm not too familiar with how to manipulate these error terms, so we have a O(1) contribution from approximating the $\lfloor{x}\rfloor$ but I don't see how this will give us the o(1) terms instead... Also thanks for not closing, I'm not sure what the differences are between MathStackexchange and MathOverflow... | |
| Jun 11, 2019 at 18:06 | comment | added | Mark Wildon | You seem to have dropped the error term from approximating $\lfloor x \rfloor$ by $x$ in the equation after `therefore we obtain'. I won't vote to close, but I think this question might be better suited to MathStackexchange. | |
| Jun 11, 2019 at 18:00 | history | edited | numbertheorylearner | CC BY-SA 4.0 |
added 161 characters in body
|
| Jun 11, 2019 at 16:08 | history | asked | numbertheorylearner | CC BY-SA 4.0 |