Timeline for how to prove an equation involving sums of Kronecker symbol
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Nov 22, 2019 at 21:10 | vote | accept | yhb | ||
| Nov 22, 2019 at 8:43 | comment | added | yhb | @GerryMyerson, Thank you for help! | |
| Nov 22, 2019 at 8:20 | vote | accept | yhb | ||
| Nov 22, 2019 at 8:23 | |||||
| Nov 22, 2019 at 4:23 | history | edited | GH from MO |
edited tags
|
|
| Nov 22, 2019 at 4:21 | answer | added | GH from MO | timeline score: 12 | |
| Nov 21, 2019 at 22:12 | comment | added | Gerry Myerson | It may help to note $(-3\mid r)=(r\mid3)$ is $1$ if $r\equiv1\bmod3$, $-1$ if $r\equiv2\bmod3$. | |
| Nov 21, 2019 at 14:36 | history | asked | yhb | CC BY-SA 4.0 |