Timeline for Practicing probabilistic heuristics in additive analytic number theory
Current License: CC BY-SA 4.0
Post Revisions
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| 8 hours ago | history | became hot network question | |||
| 12 hours ago | vote | accept | Mustafa Said | ||
| 12 hours ago | answer | added | GH from MO | timeline score: 6 | |
| 13 hours ago | history | edited | Wojowu |
edited tags
|
|
| 13 hours ago | history | edited | YCor | CC BY-SA 4.0 |
formatting
|
| 16 hours ago | comment | added | Wojowu | This is very different to what you seem to ask in the body of the question, which is explicitly about the heuristics. If you are asking about tools used to turn such heuristics into formal proofs, that's a completely different story | |
| 16 hours ago | comment | added | Mustafa Said | @Wojowu I have studied Cramer's model and I understand the heuristics behind the prime number theorem. What I want to do is run Vinogradov's method to different types of arithmetic progressions and understand the limitations of this method. | |
| 16 hours ago | comment | added | Wojowu | What you want to look into is Cramer's model, and how it's used to make probabilistic heuristics. | |
| 17 hours ago | history | asked | Mustafa Said | CC BY-SA 4.0 |