Math 2.0

Number theory Example

Lucas sequence

Example

Fix integers PP and QQ. The Lucas sequences Un(P,Q)U_n(P, Q) and Vn(P,Q)V_n(P, Q) are the solutions of the recurrence xn+2=P xn+1−Q xn(n≥0)x_{n+2} = P\, x_{n+1} - Q\, x_n \qquad (n \ge 0) with initial values U0=0U_0 = 0, U1=1U_1 = 1 and V0=2V_0 = 2, V1=PV_1 = P. The characteristic polynomial is X2−PX+QX^2 - P X + Q. If its discriminant D=P2−4QD = P^2 - 4Q is not 00, let a,ba, b be its two distinct complex roots; then Un=an−bna−b,Vn=an+bn.U_n = \frac{a^n - b^n}{a - b}, \qquad V_n = a^n + b^n. Check: both formulas solve the recurrence, since an+2=Pan+1−Qana^{n+2} = P a^{n+1} - Q a^n and likewise for bb, and they give U0=0U_0 = 0, U1=1U_1 = 1, V0=2V_0 = 2, V1=a+b=PV_1 = a + b = P.

Special cases:

  1. P=1P = 1, Q=−1Q = -1: UnU_n are the Fibonacci numbers 0,1,1,2,3,5,…0, 1, 1, 2, 3, 5, \dots and VnV_n are the Lucas numbers 2,1,3,4,7,11,…2, 1, 3, 4, 7, 11, \dots.
  2. P=2P = 2, Q=−1Q = -1: UnU_n are the Pell numbers 0,1,2,5,12,29,…0, 1, 2, 5, 12, 29, \dots.
  3. P=3P = 3, Q=2Q = 2: Un=2n−1U_n = 2^n - 1, the Mersenne numbers 0,1,3,7,15,…0, 1, 3, 7, 15, \dots, since the roots are 22 and 11.

Further reading

  1. Web https://en.wikipedia.org/wiki/Lucas_sequence
About this page
TagDP39F5KQ2W
URIm2://DP39F5KQ2W
Kindexample
WritingW0 stub
MSC11B39, 39A06
Instance ofSolution 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.