The number in the sequence defined by a 1 = 1 , a 2 = 3 , and a n = a n − 1 + a n − 2 for n ≥ 3 are referred to as Lucas numbers in honor of French mathematician Edouard Lucas 1842 − 1891 . a. Find the first eight Lucas numbers. b. The formula L n = 1 + 5 2 n + 1 − 5 2 n gives the n th Lucas number. Use a calculator to verify this statement for n = 1 , n = 2 , and n = 3 .
The number in the sequence defined by a 1 = 1 , a 2 = 3 , and a n = a n − 1 + a n − 2 for n ≥ 3 are referred to as Lucas numbers in honor of French mathematician Edouard Lucas 1842 − 1891 . a. Find the first eight Lucas numbers. b. The formula L n = 1 + 5 2 n + 1 − 5 2 n gives the n th Lucas number. Use a calculator to verify this statement for n = 1 , n = 2 , and n = 3 .
Solution Summary: The author calculates the first 8 Lucas numbers: 1, 3, 4, 7, 11, 18, 29, and 47. The pattern has a recursive formula where each term is defined using the previous two terms.
The number in the sequence defined by
a
1
=
1
,
a
2
=
3
, and
a
n
=
a
n
−
1
+
a
n
−
2
for
n
≥
3
are referred to as Lucas numbers in honor of French mathematician Edouard Lucas
1842
−
1891
.
a. Find the first eight Lucas numbers.
b. The formula
L
n
=
1
+
5
2
n
+
1
−
5
2
n
gives the
n
th Lucas number. Use a calculator to verify this statement for
n
=
1
,
n
=
2
, and
n
=
3
.
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, calculus and related others by exploring similar questions and additional content below.