Timeline for Sum of squares modulo a prime
Current License: CC BY-SA 3.0
10 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 6, 2011 at 3:25 | answer | added | Georges | timeline score: 1 | |
| Jul 6, 2011 at 2:36 | comment | added | Noam D. Elkies | As you can see, if $p \rightarrow \infty$ then already $n=3$ is enough to get near-equidistribution (and $n=2$ fails only because 0 is over- or under-represented depending on whether $p$ is $+1$ or $−1 \bmod 4$). | |
| Jul 5, 2011 at 23:04 | answer | added | GH from MO | timeline score: 9 | |
| Jul 5, 2011 at 22:54 | comment | added | user16203 | This is my intuition as well. n should be at most polynomial in log(p) and p is meant to be a prime. Is there a standard theorem for this? | |
| Jul 5, 2011 at 22:53 | comment | added | Noam D. Elkies | Yes, $p$ prime — and odd — is implicit both in the title and in the use of "quadratic residue". | |
| Jul 5, 2011 at 22:51 | answer | added | Noam D. Elkies | timeline score: 26 | |
| Jul 5, 2011 at 22:37 | comment | added | Gerhard Paseman | Also, I assume p is prime from your title, but it would help to call that out in the body of the question. Gerhard "Email Me About System Design" Paseman, 2011.07.05 | |
| Jul 5, 2011 at 22:34 | comment | added | Gerhard Paseman | Speaking as a non-expert, I should think that for n much larger than, say, log(p) (or maybe even 4), the probability should approach 1/2. Are you interested in the answer for n << p, or p << n, or is there some other relationship between n and p which would make answering the question easier? Gerhard "Email Me About System Design" Paseman, 2011.07.05 | |
| Jul 5, 2011 at 22:31 | answer | added | Gerry Myerson | timeline score: 7 | |
| Jul 5, 2011 at 22:15 | history | asked | user16203 | CC BY-SA 3.0 |