Timeline for Lower bound for character sums
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 14, 2011 at 13:15 | answer | added | Frank Thorne | timeline score: 3 | |
| Dec 14, 2011 at 3:44 | comment | added | Noam D. Elkies | Even if it were possible to have $t \ll p^{1/2 + \epsilon}$ then $p-t$ would work too and satisfy $t \gg p^{1/2 + \epsilon}$ by a wide margin... | |
| Dec 14, 2011 at 2:23 | comment | added | M.B | Fedja@: Yes. I am sure I want $\gg$. | |
| Dec 14, 2011 at 2:12 | history | edited | Stopple |
edited tags
|
|
| Dec 14, 2011 at 0:44 | comment | added | Noam D. Elkies | Burgess proved the character sum is $O(p^{3/16} t^{1/2} \log p)$, so if it's $\gg p^{1/2}$ then $t \gg p^{5/8 - \epsilon}$. | |
| Dec 14, 2011 at 0:37 | comment | added | fedja | Are you sure you want to write $\gg$ (large $t$) rather than $\ll$? | |
| Dec 14, 2011 at 0:00 | history | asked | M.B | CC BY-SA 3.0 |