Question 7
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?

We will analyze the pattern of red squares and their area at each stage.
Step 1 — Counting red squares
Let's count the red squares at each stage.
At Stage 0, we have one large square.
At Stage 1, the square is divided into 9 parts. The center part is removed. We are left with 8 red squares.
At Stage 2, each of the 8 red squares is processed. Each red square becomes 8 smaller red squares.
At Stage 3, each of the 64 red squares is processed. Each red square becomes 8 smaller red squares.

Step 2 — Predicting future stages
We see a pattern for the number of red squares. It is . Let's predict for Stage 4.
Now let's predict for Stage 5.
Step 3 — Finding the rules for red squares
The number of red squares at stage follows a power of 8. The explicit formula directly gives the number for any stage .
Here, is the stage number, starting from . The recursive formula defines a term based on the previous term.
Step 4 — Calculating the area of the red region
Let the area of Stage 0 be 1 square unit. At each stage, the square is divided into 9 parts. One part is removed. So, of the area remains.
Area at Stage 0 is 1 square unit. Area at Stage 1 is of Stage 0 area.
Area at Stage 2 is of Stage 1 area.
Area at Stage 3 is of Stage 2 area.
Step 5 — Predicting future areas
Let's predict the area for Stage 4.
Now let's predict the area for Stage 5.
Step 6 — Finding the rules for area
The area at stage follows a power of . The explicit formula directly gives the area for any stage .
Here, is the stage number, starting from . The recursive formula defines an area based on the previous area.
Step 7 — Area behavior as n increases
The area is multiplied by at each step. Since is less than 1, the area keeps getting smaller. As increases, the area approaches 0.
Answer
(i) Stages 0 to 3 have 1, 8, 64, and 512 red squares respectively. (ii) Stage 4 has 4096 red squares. Stage 5 has 32768 red squares. (iii) Explicit formula: . Recursive formula: , for . (iv) Area of red region: Stage 1 = , Stage 2 = , Stage 3 = . Area of red region: Stage 4 = , Stage 5 = . Explicit formula for area: . Recursive formula: , for . As increases, the area of the red region approaches 0.
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: 5, 25, 125, ... .
A sequence is given by the recursive rule , for . Which term of the sequence is 730?
Which term of the GP: 2, 6, 18, ... is 4374? 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?