Timeline for The number of decompositions of $2n-1$ into a difference of two squares?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 26, 2021 at 18:30 | vote | accept | François Huppé | ||
| Oct 25, 2021 at 0:03 | comment | added | Gerry Myerson | Also, everything works for odd prime values of $m$, starting from $m=m\times1$. | |
| Oct 25, 2021 at 0:02 | comment | added | Gerry Myerson | The notation $\sigma(m)$ generally denotes the sum, not the number, of divisors. For the number, most use $d(m)$ or $\tau(m)$. | |
| S Oct 24, 2021 at 18:03 | review | First answers | |||
| Oct 24, 2021 at 18:10 | |||||
| S Oct 24, 2021 at 18:03 | history | answered | François Huppé | CC BY-SA 4.0 |