Timeline for Question about estimating random symmetric sums modulo p
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 19, 2021 at 4:28 | vote | accept | shurtados | ||
| Aug 19, 2021 at 4:27 | comment | added | shurtados | In that case, I'll accept the answer, edit the question and then post another question. Thanks again for the nice answer. | |
| Aug 19, 2021 at 0:09 | comment | added | GH from MO | @shurtados: Thanks for your kind words. At MO, the policy is to ask one question in one post, and I just answered that. If you have further questions, please ask them in separate posts. Also, if you like my answer to your original (first) question, please accept it officially, so that it turns green. | |
| Aug 18, 2021 at 23:42 | comment | added | shurtados | Dear @GHfromMO, thanks a lot for the answer and for the reference. Your answer depends on the lucky coincidence that $\sum a_i^2 = n$, what about the case where $S \neq {-1,1}$?. Also,do you know of a trick that can help with the last sums which includes a_i's and b_i's?, observe that these sums are not symmetric and even in the case $S = {-1,1}$ I do not know how to approach them. | |
| Aug 18, 2021 at 22:13 | history | edited | GH from MO | CC BY-SA 4.0 |
added 2 characters in body
|
| Aug 18, 2021 at 22:08 | history | edited | GH from MO | CC BY-SA 4.0 |
added 2 characters in body
|
| Aug 18, 2021 at 22:01 | history | edited | GH from MO | CC BY-SA 4.0 |
added 477 characters in body
|
| Aug 18, 2021 at 21:49 | history | answered | GH from MO | CC BY-SA 4.0 |