HelpContactFor teachers and institutes
>_StemPy Lab
Mock TestsClasses

>_StemPy Lab

Learn. Solve. Code the solutions. Test yourself.

Live examsFree mock exams, timed and rankedEveryone starts together, and your score and rank come the moment it ends.See the exams →
Live examsInternational live exams are comingTell us which exam you want first. Timed practice papers are open now.See what is coming →

Learn

  • Physics
  • Chemistry
  • Mathematics
  • Biology
  • Python Programming
  • Statistics & Data Science
  • Computer Science
  • Space Science and Astronomy
  • Classes
  • Groups

Practice

  • Problems
  • Quizzes
  • Mock Tests
  • Prepare for an Exam
  • Question Sets
  • Exams
  • Certificates
  • Python Labs
  • AI Practice Generator
  • Student-Created Tests

Community

  • Discussions
  • Resources
  • Notes
  • Glossary
  • Blog

Account

  • Log in
© 2026 senLearn. All rights reserved.HelpFor SchoolsAboutContactPrivacy PolicyTerms of UseRefund Policy
  1. Python Labs
  2. /Fibonacci identities by computer
MathematicsMediumHigh School (11–12)Mathematical Induction

Fibonacci identities by computer

You will build the Fibonacci numbers and test two identities that the lesson proves by induction.

The idea. F1=F2=1F_1 = F_2 = 1F1​=F2​=1 and each later number is the sum of the two before it. The sum identity is F1+⋯+Fn=Fn+2−1F_1 + \dots + F_n = F_{n + 2} - 1F1​+⋯+Fn​=Fn+2​−1. Cassini's identity is Fn+1Fn−1−Fn2=(−1)nF_{n + 1}F_{n - 1} - F_n^2 = (-1)^nFn+1​Fn−1​−Fn2​=(−1)n.

Your tasks.

  1. Finish fib_list(N). Return the list [0, 1, 1, 2, 3, 5, ...] of F0F_0F0​ to FNF_NFN​, so that fib_list(N)[n] is FnF_nFn​.
  2. Finish sum_rule(N). Return True when sum(F[1:n + 1]) == F[n + 2] - 1 for every n from 1 to N.
  3. Finish cassini(n). Return Fn+1Fn−1−Fn2F_{n + 1}F_{n - 1} - F_n^2Fn+1​Fn−1​−Fn2​.

Run it first, just as it is. The checker at the end prints FAIL for each task. Then do the tasks one at a time, and run the program again after each one. A Hint appears under every check that still fails.

When every line says PASS, print cassini(n) for n=2n = 2n=2 to 121212. Then test a new guess: is F2n=Fn(Fn−1+Fn+1)F_{2n} = F_n(F_{n - 1} + F_{n + 1})F2n​=Fn​(Fn−1​+Fn+1​)?

StemPy LabContributed by StemPy Lab
python
Loading Python runtime…

A worked solution

Run your code once to unlock the worked solution.

Have you tried it?

Do the tasks in the editor first, and run the checker after each one. Its hints help when a check fails. When you are ready, compare your code with this solution.

Log in to save
← All Labs
← Where an inequality starts to holdMatrix powers against a formula →
More onMathematical Induction

Discussion (0)

Log in to join the discussion.

Loading…

More labs on this topic

  1. The Tower of Hanoi, move by moveMedium
  2. Matrix powers against a formulaMedium
  3. Where an inequality starts to holdMedium
  4. Divisibility, value by valueMedium
  5. Test a formula, then find where a pattern breaksMedium
All labs on this topic →