Timeline for Count sums of two squares
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 13, 2017 at 12:39 | history | edited | CommunityBot |
replaced http://codegolf.stackexchange.com/ with https://codegolf.stackexchange.com/
|
|
| Dec 13, 2015 at 7:33 | comment | added | xnor | Congrats for winning the bounty! The recursive subtraction is a clean and short way to express the alternating sum for odd divisors without needing to extract a sign from the divisor itself. Also, credit to xsot for streamlining Peter Taylor's solution to a recursive one with clever handling of n=0. | |
| Dec 13, 2015 at 7:29 | history | bounty ended | xnor | ||
| Dec 10, 2015 at 0:21 | history | edited | Mitch Schwartz | CC BY-SA 3.0 |
golf full program version
|
| Dec 10, 2015 at 0:08 | history | answered | Mitch Schwartz | CC BY-SA 3.0 |