# Fibonacci, inverted

**Computer Science**Level 3

**Note:** \(F_n\) is defined so that \(F_n = F_{n-1} + F_{n-2},\ n \in \mathbb{Z}.\)

**Also note:** \(\lfloor x \rfloor\) is defined as the greatest integer less than or equal to \(x.\)

**Your answer seems reasonable.**Find out if you're right!

Sign up to access problem solutions.

**That seems reasonable.**Find out if you're right!

Already have an account? Log in here.