Predicting What Comes Next: Sequences and Progressions | Exercise 8.3

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 nthn^{\text{th}} 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 nthn^{\text{th}} stage. What happens to this area as nn, the number of stages, goes on increasing?

Question diagram 1
Check your answer with HomiSolve it yourself, then let Homi check your steps and spot mistakes.
Solution
Understand the Question
  • The Sierpiński carpet is constructed recursively starting from a unit square (Stage 0).
  • At each step, every retained square is divided into 99 equal smaller squares and the central square is removed, leaving 88 squares behind.
  • Thus, at each subsequent stage:
    • The number of red squares is multiplied by 88.
    • The area of the red region is multiplied by 89\dfrac{8}{9}.

(i) How many red squares are there in Stages 0 to 3?

Step 1 · Count Red Squares in Stages 0 to 3

Diagram 1

At Stage 0: Number of red squares=1\text{Number of red squares} = 1

At Stage 1 (divided into 99 squares, 11 center square removed): Number of red squares=8\text{Number of red squares} = 8

At Stage 2 (each of the 88 squares yields 88 smaller squares):

Number of red squares=8×8=82=64\begin{aligned} \text{Number of red squares} &= 8 \times 8 \\ &= 8^2 = 64 \end{aligned}

At Stage 3:

Number of red squares=64×8=83=512\begin{aligned} \text{Number of red squares} &= 64 \times 8 \\ &= 8^3 = 512 \end{aligned}
Answer

(i) Stage 0: 11, Stage 1: 88, Stage 2: 6464, Stage 3: 512512

(ii) Can you predict the number of red squares in Stages 4 and 5?

Step 1 · Calculate Number of Squares for Stages 4 and 5

At Stage 4:

Number of red squares=84=512×8=4096\begin{aligned} \text{Number of red squares} &= 8^4 \\ &= 512 \times 8 \\ &= 4096 \end{aligned}

At Stage 5:

Number of red squares=85=4096×8=32768\begin{aligned} \text{Number of red squares} &= 8^5 \\ &= 4096 \times 8 \\ &= 32768 \end{aligned}
Answer

(ii) Stage 4: 40964096, Stage 5: 3276832768

(iii) Can you find a rule for the number of red squares at the nthn^{\text{th}} stage? Write the explicit formula as well as the recursive formula for the number of red squares at any stage.

Step 1 · Formulate Explicit and Recursive Rules

Let tnt_n be the number of red squares at stage nn for n0n \ge 0.

Explicit formula: tn=8nt_n = 8^n

Recursive formula: t0=1andtn=8×tn1 for n1t_0 = 1 \quad \text{and} \quad t_n = 8 \times t_{n-1} \text{ for } n \ge 1

Answer

(iii) Explicit formula: tn=8nt_n = 8^n; Recursive formula: t0=1,tn=8tn1 for n1t_0 = 1, t_n = 8t_{n-1} \text{ for } n \ge 1

(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 nthn^{\text{th}} stage. What happens to this area as nn, the number of stages, goes on increasing?

Step 1 · Find Area for Stages 1, 2, and 3

Given the area at Stage 0 is A0=1A_0 = 1. Since 19\dfrac{1}{9} of the area is removed at each step, 89\dfrac{8}{9} of the previous area remains.

Stage 1: Area=1×89=89\text{Area} = 1 \times \dfrac{8}{9} = \dfrac{8}{9}

Stage 2: Area=(89)2=6481\text{Area} = \left(\dfrac{8}{9}\right)^2 = \dfrac{64}{81}

Stage 3: Area=(89)3=512729\text{Area} = \left(\dfrac{8}{9}\right)^3 = \dfrac{512}{729}

Step 2 · Find Area for Stages 4 and 5

Stage 4: Area=(89)4=40966561\text{Area} = \left(\dfrac{8}{9}\right)^4 = \dfrac{4096}{6561}

Stage 5: Area=(89)5=3276859049\text{Area} = \left(\dfrac{8}{9}\right)^5 = \dfrac{32768}{59049}

Step 3 · Determine Formulas and Long-Term Behavior

Explicit formula: An=(89)nA_n = \left(\dfrac{8}{9}\right)^n

Recursive formula: A0=1andAn=89×An1 for n1A_0 = 1 \quad \text{and} \quad A_n = \dfrac{8}{9} \times A_{n-1} \text{ for } n \ge 1

Behavior as nn \to \infty: Since the common ratio 89<1\dfrac{8}{9} < 1, as nn increases, the area of the red region approaches 00.

Answer

(iv) Areas: Stage 1 = 89\dfrac{8}{9}, Stage 2 = 6481\dfrac{64}{81}, Stage 3 = 512729\dfrac{512}{729}, Stage 4 = 40966561\dfrac{4096}{6561}, Stage 5 = 3276859049\dfrac{32768}{59049}. Explicit formula: An=(89)nA_n = \left(\dfrac{8}{9}\right)^n. Recursive formula: A0=1,An=89An1A_0 = 1, A_n = \dfrac{8}{9}A_{n-1} for n1n \ge 1. As nn \to \infty, the area approaches 00.

Common Mistakes
  • Base Case Indexing: Note that the sequence begins at Stage 00 (n=0n=0), meaning t0=80=1t_0 = 8^0 = 1 and A0=(89)0=1A_0 = \left(\frac{8}{9}\right)^0 = 1. Writing tn=8n1t_n = 8^{n-1} would be an off-by-one indexing error.
  • Confusing Count and Area Ratios: The number of squares grows by a factor of 88 at each step, but the total area is multiplied by 89\dfrac{8}{9} because each new square has 19\dfrac{1}{9} the area of the previous square.

More questions in Exercise 8.3

Q1

Find the 12th12^{\text{th}} term of a GP with common ratio 2, whose 8th8^{\text{th}} term is 192.

Q2

Find the 10th10^{\text{th}} and nthn^{\text{th}} terms of the GP: 5,25,125,5, 25, 125, \dots.

Q3

A sequence is given by the recursive rule t1=2t_1 = 2, tn+1=3tn2t_{n+1} = 3t_n - 2 for n1n \ge 1. Which term of the sequence is 730?

Q4

Which term of the GP: 2,6,18,2, 6, 18, \dots is 43744374? Write the explicit formula as well as the recursive formula for the nthn^{\text{th}} term.

Q5

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 5th5^{\text{th}} bounce? (ii) What is the total vertical distance the ball has travelled by the time it hits the ground for the 6th6^{\text{th}} time?

Q6

Which term of the sequence 2,22,4,2, 2\sqrt{2}, 4, \dots is 128?

Q7

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 nthn^{\text{th}} 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 nthn^{\text{th}} stage. What happens to this area as nn, the number of stages, goes on increasing?

← Back to Predicting What Comes Next: Sequences and Progressions