Module-I

Mathematical Logic and Induction

Recursive Definitions

Dr. Govardhana Reddy H G

Content

▪ Recursive Definitions
Examples
Problems/Questions

Fibonacci Sequence in Nature (Not in syllabus)

Recursive Definitions
Sequence: Arrangement of elements of a set.
𝑎1 , 𝑎2 , 𝑎3 , … … 𝑎𝑛 , … .
The sequence is denoted by {𝑎𝑛 } or < 𝑎𝑛 >.
Methods of describing the sequence:
(i) The Explicit Method
In this method, the general term of the sequence is explicitly indicated.
(ii) Recursive Method
In this method, first few terms of the sequence are explicitly indicated, and the general term is specified
by a formula.
Example: Consider a sequence E formed by all positive even integers.

Explicit method:

Recursive Method:

A recursive rule is a formula for 𝑎𝑛 in terms of 𝑎𝑛−1 , 𝑎𝑛−2 𝑒𝑡𝑐 or a formula for 𝑎𝑛+1 in terms of
𝑎𝑛 , 𝑎𝑛−1 𝑒𝑡𝑐
Q1. Obtain a recursive definition for the sequence {𝑎𝑛 } in each of the following cases.
i) 𝑎𝑛 = 5𝑛 ii) 𝑎𝑛 = 6𝑛 iii) 𝑎𝑛 = 3𝑛 + 7 iv) 𝑎𝑛 = 𝑛(𝑛 + 2) v) 𝑎𝑛 = 𝑛2

Q2. A sequence {𝑎𝑛 } is defined recursively by 𝑎1 = 4, 𝑎𝑛 = 𝑎𝑛−1 + 𝑛 for 𝑛 ≥ 2.

Find 𝑎𝑛 in explicit form

Q3. Write the recursive definition of Fibonacci numbers and hence evaluate 𝐹2 to 𝐹10

Q4. If 𝐹𝑜 , 𝐹1 , 𝐹2 , … . are Fibonacci numbers, prove that

𝑛

෍ 𝐹𝑖 2 = 𝐹𝑛 × 𝐹𝑛+1
𝑖=0
for all positive integers.
Q5. The Lucas numbers are defined recursively 𝐿𝑜 = 2, 𝐿1 = 1 𝑎𝑛𝑑 𝐿𝑛 = 𝐿𝑛−1 + 𝐿𝑛−2
for 𝑛 ≥ 2. Evaluate 𝐿2 to 𝐿10

Relationship between Lucas and Fibonacci numbers

Q6. If 𝐹𝑖 ’s are Fibonacci numbers and 𝐿𝑖 ’s are the Lucas numbers, prove that 𝐿𝑛 = 𝐹𝑛−1 +
𝐹𝑛+1 for all positive integers.
Answer the following (Homework)
Q7. Obtain a recursive definition for the sequence {𝑎𝑛 } in each of the following cases.
i) 𝑎𝑛 = 3𝑛 ii) 𝑎𝑛 = 3𝑛 iii) 𝑎𝑛 = 2𝑛 + 3 iv) 𝑎𝑛 = 𝑛(𝑛 + 3)

Q8. Find the explicit formula for 𝑎𝑛 in each of the following

i) 𝑎𝑛 = 𝑎𝑛−1 − 2, 𝑎1 = 0 ii) 𝑎𝑛 = 𝑎𝑛−1 + 3, 𝑎1 = 2

Q9. If 𝐿𝑜 , 𝐿1 , 𝐿2 …… are lucas numbers, then prove that

𝑛

෍ 𝐿𝑖 2 = 𝐿𝑛 × 𝐿𝑛+1 − 2
𝑖=1
for all positive integers.
Q1. Obtain a recursive definition for the sequence {𝑎𝑛 } in each of the following cases.
i) 𝑎𝑛 = 5𝑛 ii) 𝑎𝑛 = 6𝑛 iii) 𝑎𝑛 = 3𝑛 + 7 iv) 𝑎𝑛 = 𝑛(𝑛 + 2) v) 𝑎𝑛 = 𝑛2
Q2. A sequence {𝑎𝑛 } is defined recursively by 𝑎1 = 4, 𝑎𝑛 = 𝑎𝑛−1 + 𝑛 for 𝑛 ≥ 2. Find 𝑎𝑛
in explicit form
Q3. Write the recursive definition of Fibonacci numbers and hence evaluate 𝐹2 to 𝐹10
Q4. If 𝐹𝑜 , 𝐹1 , 𝐹2 , … . are Fibonacci numbers, prove that
𝑛

෍ 𝐹𝑖 2 = 𝐹𝑛 × 𝐹𝑛+1
𝑖=0
for all positive integers.
Q5. The Lucas numbers are defined recursively 𝐿𝑜 = 2, 𝐿1 = 1 𝑎𝑛𝑑 𝐿𝑛 = 𝐿𝑛−1 + 𝐿𝑛−2 for
𝑛 ≥ 2. Evaluate 𝐿2 to 𝐿10
Relationship between Lucas and Fibonacci numbers
Q6. If 𝐹𝑖 ’s are Fibonacci numbers and 𝐿𝑖 ’s are the Lucas numbers, prove that 𝐿𝑛 = 𝐹𝑛−1 +
𝐹𝑛+1 for all positive integers.
Answer the following
Q7. Obtain a recursive definition for the sequence {𝑎𝑛 } in each of the following cases.
i) 𝑎𝑛 = 3𝑛 ii) 𝑎𝑛 = 3𝑛 iii) 𝑎𝑛 = 2𝑛 + 3 iv) 𝑎𝑛 = 𝑛(𝑛 + 3)

Q8. Find the explicit formula for 𝑎𝑛 in each of the following

i) 𝑎𝑛 = 𝑎𝑛−1 − 2, 𝑎1 = 0 ii) 𝑎𝑛 = 𝑎𝑛−1 + 3, 𝑎1 = 2

Q9. If 𝐿𝑜 , 𝐿1 , 𝐿2 …… are lucas numbers, then prove that

𝑛

෍ 𝐿𝑖 2 = 𝐿𝑛 × 𝐿𝑛+1 − 2
𝑖=1
for all positive integers.
Thank You