Timeline for Fibtraction - Fibonacci but with subtraction
Current License: CC BY-SA 3.0
11 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 24, 2017 at 20:02 | history | edited | ბიმო | CC BY-SA 3.0 |
Added TIO and byte count for the second solution.
|
| S Jul 10, 2017 at 22:30 | history | suggested | CR Drost | CC BY-SA 3.0 |
fleshed out the decomposition solution provided, including a better starting point and the values from 2 on.
|
| Jul 10, 2017 at 22:18 | review | Suggested edits | |||
| S Jul 10, 2017 at 22:30 | |||||
| Jul 10, 2017 at 21:45 | comment | added | ბიმო | @CRDrost Yeah it's pretty much ungolfable (at least wrt. to the other solution). Feel free to create your own answer or edit it in, if you like. | |
| Jul 10, 2017 at 21:40 | comment | added | CR Drost |
I think the most I can golf the explicit formula is the 48-byte ((1:2: -1:[round$(-(1+sqrt 5)/2)^n|n<-[2..]])!!), or subtract 6 bytes if the list is ok as output.
|
|
| Jul 9, 2017 at 16:00 | history | edited | ბიმო | CC BY-SA 3.0 |
-2 bytes.
|
| Jul 9, 2017 at 15:52 | comment | added | Laikoni |
That's fine, see the Guide to golfing rules in Haskell. For TIO you can either keep the f= or use this tip.
|
|
| Jul 9, 2017 at 14:29 | history | edited | ბიმო | CC BY-SA 3.0 |
Nobody likes typos, so I fixed that.
|
| Jul 9, 2017 at 14:24 | comment | added | ბიმო | Whoops, thanks! I thought about the anonymous function too, but then I have a naked expression in the code. Is this ok? | |
| Jul 9, 2017 at 0:28 | comment | added | Laikoni |
You can drop the space in 2 g. Also anonymous functions are allowed, so you do not need the f=.
|
|
| Jul 8, 2017 at 18:51 | history | answered | ბიმო | CC BY-SA 3.0 |