Timeline for How fast can we find all Four-Square combinations that sum to N?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 9, 2022 at 12:05 | history | edited | Juho | CC BY-SA 4.0 |
deleted 96 characters in body
|
| Jan 7, 2017 at 22:36 | comment | added | gnasher729 | About 0.04 N^1.5 triples (A, B, C), and checking that N - A^2 - B^2 - C^2 is a square can be done very quickly. | |
| Jan 7, 2017 at 13:12 | comment | added | gnasher729 | For a trivial algorithm, you only need loops for A, B, and C and then calculate D and check it is an integer. If you require A ≤ B ≤ C ≤ D you should get O (N^1.5) with a rather small constant. | |
| Aug 2, 2012 at 9:36 | history | edited | Juho | CC BY-SA 3.0 |
added 81 characters in body
|
| Aug 1, 2012 at 21:36 | history | edited | Juho | CC BY-SA 3.0 |
added 102 characters in body
|
| Aug 1, 2012 at 21:21 | history | answered | Juho | CC BY-SA 3.0 |