Kata

Draft

Fibonacci numbers are numbers that follow the pattern F(n) = F(n-1) + F(n-2) with initial conditions F(1) = F(2) = 1.

Your task is to write a function f(n) that returns the nth fibonacci number. This must be done in less than 25 characters.

Examples:

F(10) = 55
F(11) = 89
F(23) = 28657

Restricted

% of votes with a positive feedback rating	70% of 40
Total "Very Satisfied" Votes	23
Total "Somewhat Satisfied" Votes	10
Total "Not Satisfied" Votes	7
Total Rank Assessments	37
Average Assessed Rank	6 kyu
Highest Assessed Rank	5 kyu
Lowest Assessed Rank	8 kyu

Contributors