Problemintro
Fibonacci numbers
Also called Polynomial-time Fibonacci algorithm.
Computing the sequence in which each number is the sum of the two before it, with methods ranging from recursion to matrix powers.
Computing the sequence in which each number is the sum of the two before it, with methods ranging from recursion to matrix powers.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 22K1SK Edit this page History Report an error