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

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.

Number of red squares at Stage 0=1\text{Number of red squares at Stage 0} = \textbf{1}

At Stage 1, the square is divided into 9 parts. The center part is removed. We are left with 8 red squares.

Number of red squares at Stage 1=8\text{Number of red squares at Stage 1} = \textbf{8}

At Stage 2, each of the 8 red squares is processed. Each red square becomes 8 smaller red squares.

Number of red squares at Stage 2=8×8\text{Number of red squares at Stage 2} = 8 \times 8

=82= 8^2

64 red squares\boxed{\textbf{64} \text{ red squares}}

At Stage 3, each of the 64 red squares is processed. Each red square becomes 8 smaller red squares.

Number of red squares at Stage 3=64×8\text{Number of red squares at Stage 3} = 64 \times 8

=83= 8^3

512 red squares\boxed{\textbf{512} \text{ red squares}}

Diagram 1

Step 2 — Predicting future stages

We see a pattern for the number of red squares. It is 8n8^n. Let's predict for Stage 4.

Number of red squares at Stage 4=84\text{Number of red squares at Stage 4} = 8^4

=512×8= 512 \times 8

4096 red squares\boxed{\textbf{4096} \text{ red squares}}

Now let's predict for Stage 5.

Number of red squares at Stage 5=85\text{Number of red squares at Stage 5} = 8^5

=4096×8= 4096 \times 8

32768 red squares\boxed{\textbf{32768} \text{ red squares}}

Step 3 — Finding the rules for red squares

The number of red squares at stage nn follows a power of 8. The explicit formula directly gives the number for any stage nn.

Explicit formula for tn=8n\text{Explicit formula for } t_n = 8^n

Here, nn is the stage number, starting from n=0n=0. The recursive formula defines a term based on the previous term.

Recursive formula: t0=1\text{Recursive formula: } t_0 = \textbf{1}

and tn=8×tn1 for n1\text{and } t_n = 8 \times t_{n-1} \text{ for } n \ge 1

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, 8/98/9 of the area remains.

Area at Stage 0 is 1 square unit. Area at Stage 1 is 8/98/9 of Stage 0 area.

Area at Stage 1=1×89\text{Area at Stage 1} = 1 \times \frac{8}{9}

89 square units\boxed{\frac{\textbf{8}}{\textbf{9}} \text{ square units}}

Area at Stage 2 is 8/98/9 of Stage 1 area.

Area at Stage 2=89×89\text{Area at Stage 2} = \frac{8}{9} \times \frac{8}{9}

=(89)2= \left(\frac{8}{9}\right)^2

6481 square units\boxed{\frac{\textbf{64}}{\textbf{81}} \text{ square units}}

Area at Stage 3 is 8/98/9 of Stage 2 area.

Area at Stage 3=(89)2×89\text{Area at Stage 3} = \left(\frac{8}{9}\right)^2 \times \frac{8}{9}

=(89)3= \left(\frac{8}{9}\right)^3

512729 square units\boxed{\frac{\textbf{512}}{\textbf{729}} \text{ square units}}

Step 5 — Predicting future areas

Let's predict the area for Stage 4.

Area at Stage 4=(89)4\text{Area at Stage 4} = \left(\frac{8}{9}\right)^4

=40966561= \frac{4096}{6561}

40966561 square units\boxed{\frac{\textbf{4096}}{\textbf{6561}} \text{ square units}}

Now let's predict the area for Stage 5.

Area at Stage 5=(89)5\text{Area at Stage 5} = \left(\frac{8}{9}\right)^5

=3276859049= \frac{32768}{59049}

3276859049 square units\boxed{\frac{\textbf{32768}}{\textbf{59049}} \text{ square units}}

Step 6 — Finding the rules for area

The area at stage nn follows a power of 8/98/9. The explicit formula directly gives the area for any stage nn.

Explicit formula for An=(89)n\text{Explicit formula for } A_n = \left(\frac{8}{9}\right)^n

Here, nn is the stage number, starting from n=0n=0. The recursive formula defines an area based on the previous area.

Recursive formula: A0=1\text{Recursive formula: } A_0 = \textbf{1}

and An=89×An1 for n1\text{and } A_n = \frac{8}{9} \times A_{n-1} \text{ for } n \ge 1

Step 7 — Area behavior as n increases

The area is multiplied by 8/98/9 at each step. Since 8/98/9 is less than 1, the area keeps getting smaller. As nn 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: tn=8nt_n = 8^n. Recursive formula: t0=1t_0 = 1, tn=8tn1t_n = 8t_{n-1} for n1n \ge 1. (iv) Area of red region: Stage 1 = 89\frac{8}{9}, Stage 2 = 6481\frac{64}{81}, Stage 3 = 512729\frac{512}{729}. Area of red region: Stage 4 = 40966561\frac{4096}{6561}, Stage 5 = 3276859049\frac{32768}{59049}. Explicit formula for area: An=(89)nA_n = \left(\frac{8}{9}\right)^n. Recursive formula: A0=1A_0 = 1, An=89An1A_n = \frac{8}{9}A_{n-1} for n1n \ge 1. As nn increases, the area of the red region approaches 0.

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, ... .

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, ... is 4374? 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