Timeline for Count sums of two squares
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Nov 30, 2015 at 0:51 | history | edited | Riker | CC BY-SA 3.0 |
deleted 45 characters in body
|
| Nov 29, 2015 at 1:23 | comment | added | Riker | I'll look for it. | |
| Nov 29, 2015 at 1:20 | comment | added | lirtosiast | @RikerW I wasn't questioning the validity; I was saying xnor's bounty means there's a shorter but hard-to-find solution. | |
| Nov 29, 2015 at 0:52 | comment | added | Sherlock9 | I've tested a version of this, slightly modified to run on Python 3, from 0 to 101 (values provided by the OEIS). It works for all of them. | |
| Nov 29, 2015 at 0:01 | comment | added | Riker | I tested it (the new version) for all of the values he gave, that is 0-25. They were all correct. I haven't tested it for anything else though. | |
| Nov 28, 2015 at 23:58 | history | edited | Riker | CC BY-SA 3.0 |
added 2 characters in body
|
| Nov 28, 2015 at 23:57 | comment | added | lirtosiast | This looks pretty short, but knowing xnor I don't think it'll be this simple. | |
| Nov 28, 2015 at 23:56 | comment | added | lirtosiast |
@Zgarb Yeah, they should end at n+1.
|
|
| Nov 28, 2015 at 23:56 | comment | added | Zgarb |
Ok, no worries. But this also seems to give incorrect results for n=0 and n=1 (0 and 2 instead of 1 and 4). Maybe the range limits need adjusting?
|
|
| Nov 28, 2015 at 23:51 | history | edited | Riker | CC BY-SA 3.0 |
added 6 characters in body
|
| Nov 28, 2015 at 23:51 | comment | added | Riker | Thanks, I completely forgot. The link has the print statement though. I edited my code while I was making the code. | |
| Nov 28, 2015 at 23:47 | comment | added | Zgarb |
You are missing a print or return statement.
|
|
| Nov 28, 2015 at 23:46 | history | answered | Riker | CC BY-SA 3.0 |