Compute the term F(n) exactly

Students and developers use it to obtain F(n) exactly when testing an algorithm, recurrence exercise or sequence.

Compute the term F(n) exactly. The entire operation stays in your browser, and the values you enter are never sent to a server, shared, or stored.

How to use

  1. Enter the integer rank n for which you want the Fibonacci term.
  2. Check that the value stays within the range shown by the tool, from zero to ten thousand.
  3. Run the calculation to obtain the exact term F(n).
  4. Copy the result or use it to verify an exercise, a test or an algorithm.

Example

With an input such as ten, the tool computes the corresponding term in the Fibonacci sequence. Look at the exact value shown and compare it with your own calculation or your program output.

Input

10

Output

55

Limits and formats

Where processing happens

The calculation is performed locally in your browser. The rank you enter stays on your device and is not sent to an external service. You can test values without transmitting your data.

Frequently asked questions

What is the first term of the sequence?

The tool accepts an integer rank starting from zero. The exact convention depends on the presentation used by the page. To avoid ambiguity, compare the result with the definition used in your course or project.

Can I calculate a very large rank?

The stated range goes from zero to ten thousand. Beyond that, the calculation may be refused or become too heavy. For a high rank, expect a very long number and check that your display can handle it.

Is the result rounded?

No, the tool aims for an exact calculation of the requested term. It is not a floating-point approximation. If you see scientific notation, enlarge the result area to read the full integer.

Tools in the same category