Timeline for Given an integer $N$, find solutions to $X^3 + Y^3 + Z^3 - 3XYZ \equiv 1 \pmod{N}$
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 21, 2022 at 3:10 | answer | added | O. S. Dawg | timeline score: 0 | |
| Mar 24, 2021 at 11:34 | answer | added | Neil Strickland | timeline score: 3 | |
| Mar 21, 2021 at 6:12 | answer | added | Hailong Dao | timeline score: 4 | |
| Mar 21, 2021 at 5:28 | answer | added | individ | timeline score: -2 | |
| Mar 21, 2021 at 5:05 | comment | added | Gerry Myerson | So you would accept solutions with $y=-x$ (which leads to $z^3+3x^2z\equiv1\bmod n$)? | |
| Mar 20, 2021 at 23:44 | comment | added | Gautam | By non-trivial, I mean not the obvious solutions (1, 0, 0), (0, 1, 0), and (0, 0, 1). By rapidly, I mean polynomial in $\log(N)$. | |
| Mar 20, 2021 at 22:55 | comment | added | Gerry Myerson | I suppose it depends a bit on what you call "nontrivial" and what you call "rapidly". | |
| Mar 20, 2021 at 19:51 | history | asked | Gautam | CC BY-SA 4.0 |