NEWAll India NCERT Mock Test Series is now live!Take Free Test

Exploring Sequences And Progressions

Exercise 8.3

3Questions
0%Covered
GPT Search EngineAI-Powered Search & Navigation

Search Any Question, Exercise or Concept Instantly

AI-Powered Search connects all pages for instant navigation and answers.

Problems
3 total
Q1

Find the 12th term of a GP with common ratio 22, whose 8th term is 33.

Pending
Q2

2. Find the 10th and nnth terms of the GP: 5,25,125,…5, 25, 125, \dots.

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

4. 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 nnth term.

5. A ball is dropped from a height of 8080 metres. After hitting the ground, it bounces back to 60%60\% of the height from which it fell. It continues bouncing in this way — each time rising to 60%60\% of the previous height.
(i) What height does the ball reach after the 5th bounce?
(ii) What is the total vertical distance the ball has travelled by the time it hits the ground for the 6th time?

6. Which term of the sequence 2,4,8,…2, 4, 8, \dots is 128128?

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.

[Fig. 8.12: Stages 0, 1, 2 and 3 of the Sierpiński square carpet]

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 nnth 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 11 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 nnth stage. What happens to this area as nn, the number of stages, goes on increasing?

Pending
Q192
Pending