Select Page

Create a function that will find the nth Fibonacci number using recursion.

Fibonacci series: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, … . Use nth = 14

## Explanation

The Fibonacci numbers are the numbers in the following integer sequence.
0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ……..

In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation

```Fn = Fn-1 + Fn-2

with seed values

F0 = 0 and F1 = 1

Examples:
Input  : n = 2
Output : 1

Input  : n = 9
Output : 34

The solution is a simple method that is a direct recursive implementation
mathematical recurrence relation given above.

For Input: n = 14
Output: 377

```

## Follow me on Instagram and don’t miss the latest Challenge!

https://www.instagram.com/arnold.code/

## Become a bullet proof developer and seek my coding adventures on Udemy

https://www.udemy.com/user/arnold-abraham-3/

## Don’t Miss My Most Read Article with over 8000 Views

One Reason Not to Migrate From JavaScript to TypeScript

Typescript saves a lot of development time, but is it worth an entire migrating process?