Timeline for Explicit estimates for $N(T,\chi)$ (not $N(T,\chi)+N(T,\overline{\chi})$)
Current License: CC BY-SA 4.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Dec 21, 2021 at 14:06 | history | bounty ended | CommunityBot | ||
| S Dec 21, 2021 at 14:06 | history | notice removed | CommunityBot | ||
| S Dec 13, 2021 at 12:34 | history | bounty started | H A Helfgott | ||
| S Dec 13, 2021 at 12:34 | history | notice added | H A Helfgott | Draw attention | |
| Dec 6, 2021 at 7:50 | comment | added | H A Helfgott | And yes, by the linear independence of $\pi$ and $\log 2, \log 3,\dotsc,\log p$ over $\mathbb{Q}$, $t$ and $\chi$ can conspire, and so the bound is tight, for $t$ and $\chi$ unbounded. (As @juan points out below - use Kronecker's theorem.) | |
| Dec 6, 2021 at 7:48 | history | edited | H A Helfgott | CC BY-SA 4.0 |
edited body
|
| Dec 6, 2021 at 7:48 | comment | added | H A Helfgott | Important self-correction: I should have said $\arcsin$, not $\arctan$. You still get a tighter upper bound. | |
| Dec 4, 2021 at 19:51 | history | edited | GH from MO | CC BY-SA 4.0 |
edited body
|
| Dec 4, 2021 at 17:44 | answer | added | juan | timeline score: 3 | |
| Dec 4, 2021 at 17:09 | history | edited | YCor | CC BY-SA 4.0 |
fixed typo
|
| Dec 4, 2021 at 16:41 | history | asked | H A Helfgott | CC BY-SA 4.0 |