Question 4
Which term of the GP: is ? Write the explicit formula as well as the recursive formula for the term.
- A Geometric Progression (GP) is a sequence where each term after the first is found by multiplying the previous term by a fixed non-zero number called the common ratio ().
- Given GP:
- First term:
- Common ratio:
- To solve the problem:
- Find the explicit formula for the general term: .
- Equate and solve for using powers of .
- Write the recursive formula, which defines the first term and gives the rule for .
Step 1 · Find the Explicit Formula

First term
Common ratio :
The explicit formula for the term is :
Step 2 · Find the Term Number for 4374
Set :
Express as a power of :
Comparing exponents:
Therefore, is the term.
Step 3 · Write the Recursive Formula
A recursive formula requires the first term and the relation between consecutive terms:
(i) is the term.
(ii) Explicit formula:
(iii) Recursive formula: ,
- Exponent Off-by-One Error: Writing the explicit formula as instead of , which incorrectly gives .
- Incomplete Recursive Formula: Omitting the base term or the domain . A recursive definition is incomplete without specifying the starting value.
- Power Factorisation Mistake: Making an arithmetic error while expressing as .
More questions in Exercise 8.3
Find the term of a GP with common ratio 2, whose term is 192.
Find the and terms of the GP: .
A sequence is given by the recursive rule , for . Which term of the sequence is 730?
Which term of the GP: is ? Write the explicit formula as well as the recursive formula for the term.
A ball is dropped from a height of 80 metres. After hitting the ground, it bounces back to 60% of the height from which it fell. It continues bouncing in this way—each time rising to 60% of the previous height.
(i) What height does the ball reach after the bounce? (ii) What is the total vertical distance the ball has travelled by the time it hits the ground for the time?
Which term of the sequence is 128?
Fig. 8.12 shows Stages 0 to 3 of the Sierpiński square carpet. Stage 0 of this fractal is a square sheet of paper. To construct Stage 1, each side of the square is trisected and the points of trisection of opposite sides are joined to obtain nine smaller squares. The centre square is then removed and the 8 smaller squares are retained, leaving a square hole in the centre. The same process is repeated on the eight smaller shaded squares to obtain Stage 2 and so on.
Look at Fig. 8.12 and try to answer the following questions.
(i) How many red squares are there in Stages 0 to 3? (ii) Can you predict the number of red squares in Stages 4 and 5? (iii) Can you find a rule for the number of red squares at the stage? Write the explicit formula as well as the recursive formula for the number of red squares at any stage. (iv) Suppose the area of the square in Stage 0 is 1 square unit. What is the area of the red region in Stages 1, 2 and 3? What will be the area of the red region in Stages 4 and 5? Find the explicit as well as the recursive formula for the area of the red region at the stage. What happens to this area as , the number of stages, goes on increasing?