Timeline for Am I a Fibonacci Number?
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 13, 2017 at 22:49 | history | edited | Stephen | CC BY-SA 3.0 |
added 51 characters in body
|
| Jun 21, 2017 at 12:46 | comment | added | Gryphon | Congrats on the shortest code. Since this challenge has been up for nearly a week, its time to mark the accepted answer, and this is it! | |
| Jun 21, 2017 at 12:45 | vote | accept | Gryphon | ||
| Jun 16, 2017 at 16:18 | comment | added | Enrico Borba | That's awesome! Just tried it now. | |
| Jun 16, 2017 at 15:12 | comment | added | Okx | @EnricoBorba Neim knows that the nth element in this infinite list will always be equal to or less than the n+1th element in the list. Therefore, it can catch itself and it will not run forever. Have you tried the program it? :P | |
| Jun 16, 2017 at 15:09 | comment | added | Enrico Borba | Doesn't this loop forever if the input is not in the list? If so, does that count as falsey? | |
| Jun 16, 2017 at 15:06 | comment | added | Okx |
@sm4rk0 That's great, but you're wrong. Neim uses a custom codepage, so the byte representation of this is 66 D5
|
|
| Jun 16, 2017 at 14:05 | comment | added | sm4rk0 | That's great, but not 2 bytes. In UTF-8 it's represented as "66 F0 9D 95 9A" | |
| Jun 14, 2017 at 17:25 | history | edited | Okx | CC BY-SA 3.0 |
deleted 2 characters in body
|
| Jun 14, 2017 at 17:14 | history | edited | Okx | CC BY-SA 3.0 |
deleted 3 characters in body
|
| Jun 14, 2017 at 17:01 | history | edited | Okx | CC BY-SA 3.0 |
added 159 characters in body
|
| Jun 14, 2017 at 17:01 | comment | added | Gryphon | Wow! Impressive score. | |
| Jun 14, 2017 at 17:00 | history | answered | Okx | CC BY-SA 3.0 |