Timeline for A question about the prime counting function
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 14, 2023 at 6:27 | answer | added | 2734364041 | timeline score: 5 | |
| S Nov 14, 2023 at 6:22 | history | suggested | Daniel Weber | CC BY-SA 4.0 |
Added parenthesis for ln, and removed non-LaTeX version and note.
|
| Nov 14, 2023 at 5:36 | comment | added | Daniel Weber | This doesn't follow from fairly strong non-asymptotic bounds on the prims counting function, and I think it fails if $\pi(n^2) > \text{li}(n^2)$, see Skewes's number, so it should fail sometimes for big numbers. It might follow from weaker results on deviations of the prime counting function, I'm not sure | |
| Nov 14, 2023 at 5:24 | review | Suggested edits | |||
| S Nov 14, 2023 at 6:22 | |||||
| Nov 14, 2023 at 5:22 | comment | added | Martin Sleziak | You wrote: "I still don't know how to write mathematical expressions". You can check whether the edits make this into the equation you wanted to write. You can find some useful pointers here: How does one type mathematical formulas on this site? | |
| Nov 14, 2023 at 5:21 | comment | added | Daniel Weber | Is there a reason this question is framed in terms of $n+1$ and not $n$ ($\pi(n^2) < \frac{(n+1)^2}{\ln((n+1)^2)}$)? | |
| S Nov 14, 2023 at 5:20 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
added 63 characters in body; edited tags
|
| Nov 14, 2023 at 5:19 | review | Suggested edits | |||
| S Nov 14, 2023 at 5:20 | |||||
| Nov 14, 2023 at 4:31 | review | Close votes | |||
| Nov 27, 2023 at 3:02 | |||||
| Nov 14, 2023 at 4:20 | history | edited | Egehan Eren | CC BY-SA 4.0 |
added 2 characters in body
|
| Nov 14, 2023 at 4:10 | history | asked | Egehan Eren | CC BY-SA 4.0 |