Lucas sequence
Example
Fix integers and . The Lucas sequences and are the solutions of the recurrence with initial values , and , . The characteristic polynomial is . If its discriminant is not , let be its two distinct complex roots; then Check: both formulas solve the recurrence, since and likewise for , and they give , , , .
Special cases:
- , : are the Fibonacci numbers and are the Lucas numbers .
- , : are the Pell numbers .
- , : , the Mersenne numbers , since the roots are and .
Further reading
About this page
| Tag | DP39F5KQ2W |
|---|---|
| URI | m2://DP39F5KQ2W |
| Kind | example |
| Writing | W0 stub |
| MSC | 11B39, 39A06 |
| Instance of | Solution of a linear recurrence |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.