Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Lucas sequence
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
{{Short description|Certain constant-recursive integer sequences}} {{distinguish|text=the sequence of [[Lucas number]]s, which is a particular Lucas sequence}} In [[mathematics]], the '''Lucas sequences''' <math>U_n(P,Q)</math> and <math>V_n(P, Q)</math> are certain [[constant-recursive sequence|constant-recursive]] [[integer sequence]]s that satisfy the [[recurrence relation]] : <math>x_n = P \cdot x_{n - 1} - Q \cdot x_{n - 2}</math> where <math>P</math> and <math>Q</math> are fixed [[integer]]s. Any sequence satisfying this recurrence relation can be represented as a [[linear combination]] of the Lucas sequences <math>U_n(P, Q)</math> and <math>V_n(P, Q).</math> More generally, Lucas sequences <math>U_n(P, Q)</math> and <math>V_n(P, Q)</math> represent sequences of [[polynomial]]s in <math>P</math> and <math>Q</math> with integer [[coefficient]]s. Famous examples of Lucas sequences include the [[Fibonacci number]]s, [[Mersenne number]]s, [[Pell number]]s, [[Lucas number]]s, [[Jacobsthal number]]s, and a superset of [[Fermat number]]s (see below). Lucas sequences are named after the [[France|French]] mathematician [[Édouard Lucas]].
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)