👉👉👉Challenge👈👈👈 (Fibonacci numbers)

Question

Given the position of the Fibonacci number, make a function(can be recursive) and calculate the number.

here is the series:
1 1 2 3 5 8 13...

Example:
Input: 6
output: 8

Have fun. If you like this challenge tell your friends and give an upvote.

Answer 1

here we go ,
https://code.sololearn.com/c6ErdwUmKLPK/?ref=app

Answer 2

thnks 4 marking my answer best ... yeah ☺

Answer 3

https://code.sololearn.com/caP8649IZ2fH/?ref=app

it can calculate up to 141th number

Answer 4

Here's mine :

https://code.sololearn.com/cWhnd0iDNlM5/?ref=app

Answer 5

(javascript)
var fibonacci = function(n){
return Math.round(Math.pow((1+Math.sqrt(5))/2,n)/Math.sqrt(5));
}

Answer 6

Here.
https://code.sololearn.com/cIXUDM4MRU4J/?ref=app

Answer 7

Technically that's not recursive, just using a for loop and an array. 😉

Answer 8

https://code.sololearn.com/csPRuvscP5FY/?ref=app

Answer 9

https://code.sololearn.com/c5tk30L15s4w/?ref=app

Answer 10

i sort of used that too. I used recursive functions 🤗

Answer 11

@ Gaurav Agrawal
you're welcome 😋

Answer 12

https://code.sololearn.com/ce0f7gKKfGcc/?ref=app
here

Answer 13

https://code.sololearn.com/cbxhNkh8wlF3/?ref=app

Answer 14

https://code.sololearn.com/cFSrGw3QKTa1/?ref=app