Problemadvanced
n-th term of a linear recurrence
Also called coefficient of a rational generating function.
Compute the n-th term of a linear recurrence with constant coefficients in O(M(d) log n) time.
Compute the n-th term of a linear recurrence with constant coefficients in O(M(d) log n) time.
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 8X8ES6 Edit this page History Report an error