Timeline for Sum of two squares
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 9, 2022 at 10:29 | comment | added | Robin Ryder | Thanks! Posted. | |
| Feb 9, 2022 at 6:02 | comment | added | pajonk | @RobinRyder, nice idea - I think it's worth a separate answer. | |
| Feb 8, 2022 at 21:00 | comment | added | Robin Ryder |
If you are prepared to be highly inefficient, you can check instead whether 2^n is in 2^k %o% 2^k, which is shorter than having to call outer: 37 bytes
|
|
| Feb 7, 2022 at 13:00 | comment | added | pajonk | @Giuseppe, indeed, it would - thanks! | |
| Feb 7, 2022 at 13:00 | history | edited | pajonk | CC BY-SA 4.0 |
added 74 characters in body
|
| Feb 7, 2022 at 12:51 | comment | added | Giuseppe |
Wouldn't n%in%outer(k,k,"+") be shorter?
|
|
| Feb 7, 2022 at 9:03 | history | answered | pajonk | CC BY-SA 4.0 |