Timeline for Sum my Fibonaccified divisors!
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | Community Bot |
Commonmark migration
|
|
| May 23, 2017 at 18:50 | history | edited | Shaggy | CC BY-SA 3.0 |
added 2 characters in body
|
| May 23, 2017 at 16:54 | history | edited | Shaggy | CC BY-SA 3.0 |
edited body
|
| May 23, 2017 at 16:35 | comment | added | Shaggy |
@ETHproductions, that creates an overflow that can be solved by changing g(z) to g(z|0) but brings us back up to the same byte count.
|
|
| May 23, 2017 at 16:20 | comment | added | ETHproductions |
I think you can change (z=g(i)/y)>~~z to (z=g(i)/y)%1, if you're just checking that z is an integer.
|
|
| May 23, 2017 at 16:13 | history | edited | Shaggy | CC BY-SA 3.0 |
added 9 characters in body
|
| May 23, 2017 at 16:06 | history | answered | Shaggy | CC BY-SA 3.0 |