Skip to main content
Code Golf

You are not logged in. Your edit will be placed in a queue until it is peer reviewed.

We welcome edits that make the post easier to understand and more valuable for readers. Because community members review edits, please try to make the post substantially better than how you found it, for example, by fixing grammar or adding additional resources and hyperlinks.

Required fields*

7
  • 43
    \$\begingroup\$ Slight nit-pick: shouldn't this be considered inverse fibonacci en.m.wikipedia.org/wiki/Inverse_function \$\endgroup\$ Commented Jul 18, 2016 at 0:17
  • 22
    \$\begingroup\$ So, iccanobiF?! \$\endgroup\$ Commented Jul 18, 2016 at 11:24
  • 8
    \$\begingroup\$ @Michael this is not inverse Fibonacci, because there's no inverse to Fibonacci function because it is not injective (because the "1" appears twice). The reverse originally came from the idea of "reverse table look-ups" which is what I expected people to do here (e.g. I expected them to do it to solve the problem). \$\endgroup\$ Commented Jul 18, 2016 at 14:19
  • 13
    \$\begingroup\$ The function here could be considered a right inverse of the "Fibonacci function" from the non-negative integers to the set of Fibonacci numbers. The existence of a right inverse does not imply injectivity. \$\endgroup\$ Commented Jul 18, 2016 at 17:31
  • 2
    \$\begingroup\$ @SEJPM: I kinda did expect a task like "write a program that spells out the fibonacci sequence backwards", though. \$\endgroup\$ Commented Jul 20, 2016 at 3:58