Timeline for Fibonacci Exponents
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 1, 2017 at 19:19 | comment | added | Brad Gilbert b2gills | Actually it works because &infix:<+> can accept 0,1 or 2 arguments. (&[+] is a short way of writing &infix:<+>). The WhateverCode * + * accepts exactly 2 arguments. (&[0]() == 0 so you have to have the 1 there to start off the sequence) | |
| Jan 1, 2017 at 18:55 | comment | added | Sean | @BradGilbertb2gills Cool, I had no idea the Fibonacci sequence could be expressed that way. | |
| Jan 1, 2017 at 18:54 | history | edited | Sean | CC BY-SA 3.0 | added 57 characters in body |
| Jan 1, 2017 at 6:47 | comment | added | Brad Gilbert b2gills | (1,&[+]...*) is one byte shorter, and the space after Z** isn't needed. | |
| Dec 31, 2016 at 19:55 | history | answered | Sean | CC BY-SA 3.0 |