Exploring the Lucas Numbers

Math 242 Modern Computational Mathematics

Computing generalized Fibonacci (or “gibonacci”) sequences

We will modify our fibonacciList module so that it computes recursive sequences with any starting values that we specify. Specifically, we will compute generalized Fibonacci (or “gibonacci”) sequences defined as follows:

(Subscript[G, 0])=a, (Subscript[G, 1])=b, and (Subscript[G, n])=(Subscript[G, n-2])+(Subscript[G, n-1]) for n>1.

For example, if we set a=0 and b=1, then we get the Fibonacci sequence. If we set a=2 and b=1, then we get the Lucas numbers.

gibonacciList[a_,b_,n_]:=Module[{gibList=Table[0,n+1]},
(* set the initial values (Subscript[G, 0]) and (Subscript[G, 1]) *)
gibList[[1]]=a;
gibList[[2]]=b;

(* compute (Subscript[G, 2]) through (Subscript[G, n]) and store them in the list *)
Do[
gibList[[i]]=gibList[[i-1]]+gibList[[i-2]]
,{i,3,n+1}];

(* return the list *)
gibList
]

Make sure it works:

gibonacciList[0,1,20] (* Fibonacci numbers *)

gibonacciList[2,1,20] (* Lucas numbers *)

gibonacciList[5,5,20]

The Lucas Numbers

Since we will explore the Lucas numbers today, let’s create a big list of Lucas numbers:

lucList=gibonacciList[2,1,10000];

Next we create a little function l to adjust the indexing to match the usual mathematical notation. (That is, (Subscript[L, 0])=2, (Subscript[L, 1])=1, etc.)

l[n_]:=lucList[[n+1]]

l/@Range[0,10]

1. Ratios of Lucas numbers

(a) Examine the ratios ((Subscript[L, n+1])/(Subscript[L, n])) for various n. Do these ratios converge to some number as n increases? Formulate a conjecture supported by your computational evidence.

(b) Examine the ratios ((Subscript[L, n+m])/(Subscript[L, n])) for various n and m. Formulate a conjecture about (lim_(n->∞))((Subscript[L, n+m])/(Subscript[L, n])) for m∈{1,2,3,...} supported by your computational evidence.

TableForm[Table[l[n+m]/l[n],{n,1,20},{m,1,10}],TableHeadings->{{"n"},{"m"}}]//N

Table[((((((1+(Sqrt[5])))/2)))^m),{m,1,10}]//N

((((((1+(Sqrt[5])))/2)))^2)//N

1+((((1+(Sqrt[5])))/2))//N

Conjecture: The Lucas numbers satisfy (lim_(n->∞))((Subscript[L, n+m])/(Subscript[L, n]))=(((((1+(Sqrt[5]))/2)))^m) for nonnegative integers m.

N[l[1001]/l[1000],20]

2. Is there an analog of Cassini’s identity for the Lucas numbers?

Compute (Subscript[L, n+1])(Subscript[L, n-1])-(Subscript[L, n]^2) for various positive integers n. Formulate a conjecture. How does your conjecture compare to Cassini’s identity for the Fibonacci numbers?

3. Are there polynomial identities involving the Lucas numbers?

(a) Search for an identity of the form (Subscript[L, 2n])=a (Subscript[L, n]^2) +b (Subscript[L, n])+c for some coefficients a,b,c and positive integers n. Formulate a conjecture supported by your computational evidence.

(b) Search for an identity of the form (Subscript[L, 3n])=a (Subscript[L, n]^3) +b (Subscript[L, n]^2)+c (Subscript[L, n])+d for some coefficients a,b,c,d and positive integers n. Formulate a conjecture supported by your computational evidence.

(c) Extend your results from parts (a) and (b). What is the most general statement that you can make about polynomial identities involving Lucas numbers?