178 MATHEMATICS
The number of person’s ancestors for the first, second, third, …, tenth generations are
2, 4, 8, 16, 32, …, 1024. These numbers form what we call a sequence.
Consider the successive quotients that we obtain in the division of 10 by 3 at
different steps of division. In this process we get 3,3.3,3.33,3.333, ... and so on. These
quotients also form a sequence. The various numbers occurring in a sequence are
called its
terms. We denote the terms of a sequence by a
1
, a
2
, a
3
, …, a
n
, …, etc., the
subscripts denote the position of the term. The n
th
term is the number at the n
th
position
of the sequence and is denoted by a
n.
The
n
th
term is also called the general
term
of the
sequence.
Thus, the terms of the sequence of person’s ancestors mentioned above are:
a
1
= 2, a
2
= 4, a
3
= 8, …, a
10
= 1024.
Similarly, in the example of successive quotients
a
1
= 3, a
2
= 3.3, a
3
= 3.33, …, a
6
= 3.33333, etc.
A sequence containing finite number of terms is called a finite sequence. For
example, sequence of ancestors is a finite sequence since it contains 10 terms (a fixed
number).
A sequence is called infinite, if it is not a finite sequence. For example, the
sequence of successive quotients mentioned above is an infinite sequence, infinite in
the sense that it never ends.
Often, it is possible to express the rule, which yields the various terms of a sequence
in terms of algebraic formula. Consider for instance, the sequence of even natural
numbers 2, 4, 6, …
Here a
1
= 2 = 2 × 1 a
2
= 4 = 2 × 2
a
3
= 6 = 2 × 3 a
4
= 8 = 2 × 4
.... .... ....
.... .... ....
.... .... ....
.... .... ....
a
23
= 46 = 2 × 23, a
24
= 48 = 2 × 24, and so on.
In fact, we see that the n
th
term of this sequence can be written as a
n
=
2n,
where n is a natural number. Similarly, in the sequence of odd natural numbers 1,3,5, …,
the
n
th
term is given by the formula, a
n
= 2n – 1, where n is a natural number.
In some cases, an arrangement of numbers such as 1, 1, 2, 3, 5, 8,.. has no visible
pattern, but the sequence is generated by the recurrence relation given by
a
1
= a
2
= 1
a
3
= a
1
+ a
2
a
n
= a
n – 2
+ a
n – 1
, n > 2
This sequence is called Fibonacci sequence.