Timeline for Solutions to Diophantine equation for Ramanujan graph construction
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 15, 2020 at 7:27 | history | edited | CommunityBot |
Commonmark migration
|
|
| Oct 2, 2019 at 18:01 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 2, 2019 at 17:58 | answer | added | M. Vidyasagar | timeline score: 1 | |
| Mar 1, 2019 at 11:38 | comment | added | Josu Etxezarreta Martinez | Thank you, now I understand what you were saying there. | |
| Mar 1, 2019 at 10:04 | comment | added | Henri Cohen | Lagrange showed that any $n$ is a sum of 4 squares, and if I am not mistaken, Jacobi showed that the number of such representations is $8(\sigma_1(n)-\sigma_1(n/4))$. | |
| Mar 1, 2019 at 9:59 | comment | added | Josu Etxezarreta Martinez | Thanks for the insight, I had the intuition that there are $p+1$ solutions to the equation. One last thing, what do you mean by Lagrange-Jacobi in the parenthesis? | |
| Feb 28, 2019 at 15:05 | comment | added | Henri Cohen | The conditions (apart from $a>0$) are automatically satisfied up to permutation. The total number (Lagrange Jacobi) is $8(p+1)$, so since one of $a$ $b$ $c$ $d$ is specified, divide by $4$, and since you ask $a>0$, divide again by $2$, so in every case the answer is that there are $p+1$ solutions. | |
| Feb 28, 2019 at 10:58 | history | asked | Josu Etxezarreta Martinez | CC BY-SA 4.0 |