### Sign up or log in to check your solutions

**First time here?**Enter your email and password, and we'll create your account.

**Returning user?**Enter your email and password, and you'll be logged in.

- 1. Input, print and numbers
- 2. Integer and float numbers
- 3. Conditions: if, then, else
- 4. For loop with range
- 5. Strings
- 6. While loop
- 7. Lists
- 8. Functions and recursion
- 9. Two-dimensional lists (arrays)
- 10. Sets
- 11. Dictionaries
- 12. JavaScript
- 13. HTML5 and CSS
- 14. Responsive Design with Bootstrap
- 15. jQuery

# Fibonacci numbers

## Statement

Given a non-negative integer \( n \), print the \( n \)th Fibonacci number. Do this by writing a function`fib(n)`

which takes the non-negative integer \( n \) and returns the \( n \)th Fibonacci number. Don't use loops, use the *flair* of recursion instead. However, you should think about why the recursive method is much slower than using loops.

In all the problems input the data using `input()`

and print the result using `print()`

.