Timeline for Implement the Fibonacci-quine
Current License: CC BY-SA 3.0
14 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 23, 2017 at 12:41 | history | edited | CommunityBot |
replaced http://stackoverflow.com/ with https://stackoverflow.com/
|
|
| May 9, 2017 at 6:01 | history | edited | rbntd | CC BY-SA 3.0 |
added LEaky Nun's suggestion
|
| May 9, 2017 at 5:33 | comment | added | Leaky Nun | So you can use my suggestion now \o/ | |
| May 9, 2017 at 5:32 | comment | added | rbntd | @LeakyNun Yep, i think I misunderstood the question. I thought you needed to output the next Fibonnaci number greater than the input, whether the input is one or not. | |
| May 8, 2017 at 15:31 | comment | added | Leaky Nun |
I don't understand. 31000 isn't a Fibonacci number.
|
|
| May 8, 2017 at 15:28 | comment | added | rbntd | @LeakyNun wow, that's short ! But isn't it too approximate ? it outputs 50159 for i = 31000 although the right answer should be 46368 | |
| May 8, 2017 at 15:21 | comment | added | Leaky Nun |
Golfed version: x=i=>console.log('x='+x+';x('+(i*(5**.5+1)/2+.5|0)+')');x(2)
|
|
| May 8, 2017 at 15:15 | comment | added | rbntd | @LeakyNun Hopefully fixed now ! | |
| May 8, 2017 at 15:14 | history | edited | rbntd | CC BY-SA 3.0 |
now with the quine part...
|
| May 8, 2017 at 15:13 | history | undeleted | rbntd | ||
| May 8, 2017 at 14:57 | history | deleted | rbntd | via Vote | |
| May 8, 2017 at 14:56 | review | First posts | |||
| May 8, 2017 at 14:59 | |||||
| May 8, 2017 at 14:56 | comment | added | Leaky Nun | Welcome to PPCG! We hope that you will have a great time here. | |
| May 8, 2017 at 14:55 | history | answered | rbntd | CC BY-SA 3.0 |