Home
Class 12
MATHS
If A1 is the area area bounded by |x-ai...

If `A_1` is the area area bounded by `|x-a_i| + |y|=b_i, i in N` ,where `a_(i+1) =a_i+3/2 b_i and b_(i+1)=b_i/2,a_i=0 and b_i=32`, then

A

`A_(3)=128`

B

`A_(3)=256`

C

`underset(nrarroo)limoverset(n)underset(i=1)SigmaA_(i)=(8)/(3)(32)^(2)`

D

`underset(nrarroo)limoverset(n)underset(i=1)SigmaA_(i)=(4)/(3)(16)^(2)`

Text Solution

AI Generated Solution

The correct Answer is:
To solve the given problem step by step, we will first analyze the area bounded by the equation \( |x - a_i| + |y| = b_i \) and then find the required areas \( a_i \) for \( i = 1, 2, 3 \). ### Step 1: Understanding the Area The equation \( |x - a_i| + |y| = b_i \) represents a diamond (or rhombus) shape in the coordinate plane. The vertices of this diamond are located at: - \( (a_i + b_i, 0) \) - \( (a_i - b_i, 0) \) - \( (a_i, b_i) \) - \( (a_i, -b_i) \) The area \( A \) of a diamond can be calculated using the formula: \[ A = \frac{1}{2} \times d_1 \times d_2 \] where \( d_1 \) and \( d_2 \) are the lengths of the diagonals. In this case, the diagonals are \( 2b_i \) and \( 2b_i \), so: \[ A = \frac{1}{2} \times (2b_i) \times (2b_i) = 2b_i^2 \] ### Step 2: Calculate \( a_1 \) Given: - \( a_1 = 0 \) - \( b_1 = 32 \) The area \( a_1 \) is: \[ a_1 = 2b_1^2 = 2 \times (32)^2 = 2 \times 1024 = 2048 \] ### Step 3: Calculate \( a_2 \) and \( b_2 \) Using the recurrence relations: - \( a_{i+1} = a_i + \frac{3}{2} b_i \) - \( b_{i+1} = \frac{b_i}{2} \) For \( i = 1 \): \[ a_2 = a_1 + \frac{3}{2} b_1 = 0 + \frac{3}{2} \times 32 = 48 \] \[ b_2 = \frac{b_1}{2} = \frac{32}{2} = 16 \] Now, calculate \( a_2 \): \[ a_2 = 2b_2^2 = 2 \times (16)^2 = 2 \times 256 = 512 \] ### Step 4: Calculate \( a_3 \) and \( b_3 \) For \( i = 2 \): \[ a_3 = a_2 + \frac{3}{2} b_2 = 48 + \frac{3}{2} \times 16 = 48 + 24 = 72 \] \[ b_3 = \frac{b_2}{2} = \frac{16}{2} = 8 \] Now, calculate \( a_3 \): \[ a_3 = 2b_3^2 = 2 \times (8)^2 = 2 \times 64 = 128 \] ### Step 5: Sum of Areas as \( n \to \infty \) The areas \( a_i \) form a geometric progression: - \( a_1 = 2048 \) - \( a_2 = 512 \) - \( a_3 = 128 \) The common ratio \( r \) can be calculated as: \[ r = \frac{a_2}{a_1} = \frac{512}{2048} = \frac{1}{4} \] The sum of the infinite geometric series is given by: \[ S = \frac{a_1}{1 - r} = \frac{2048}{1 - \frac{1}{4}} = \frac{2048}{\frac{3}{4}} = 2048 \times \frac{4}{3} = \frac{8192}{3} \] ### Final Result Thus, we have: - \( a_3 = 128 \) - The limit as \( n \to \infty \) of the sum of areas \( \sum_{i=1}^{n} a_i = \frac{8192}{3} \)

To solve the given problem step by step, we will first analyze the area bounded by the equation \( |x - a_i| + |y| = b_i \) and then find the required areas \( a_i \) for \( i = 1, 2, 3 \). ### Step 1: Understanding the Area The equation \( |x - a_i| + |y| = b_i \) represents a diamond (or rhombus) shape in the coordinate plane. The vertices of this diamond are located at: - \( (a_i + b_i, 0) \) - \( (a_i - b_i, 0) \) - \( (a_i, b_i) \) ...
Promotional Banner

Topper's Solved these Questions

  • AREA

    CENGAGE ENGLISH|Exercise Linkded Comprehension Type|21 Videos
  • AREA

    CENGAGE ENGLISH|Exercise Matrix Match Type|5 Videos
  • AREA

    CENGAGE ENGLISH|Exercise Exercises - Single Correct Answer Type|40 Videos
  • APPLICATIONS OF DERIVATIVES

    CENGAGE ENGLISH|Exercise Comprehension Type|5 Videos
  • BINOMIAL THEOREM

    CENGAGE ENGLISH|Exercise Matrix|4 Videos

Similar Questions

Explore conceptually related problems

If f(x) =Pi_(i=1)^3(x-a_i) + sum_(i=1)_3 a_i - 3x where a_i < a_(i+1) for i = 1,2, then f(x) = 0 have

If f(x) =Pi_(i=1)^3(x-a_i) + sum_(i=1)_3 a_i - 3x where a_i < a_(i+1) for i = 1,2, then f(x) = 0 have

If the expression (-3 I ^(2) + 2i )/(2 +i) is written in the form a + bi, where a and b are real numbers and I = sqrt-1, what is the value of a ?

Let V be the volume of the parallelepiped formed by the vectors vec a = a_i hat i +a_2 hat j +a_3 hat k and vec b =b_1 hat i +b_2 hat j +b_3 hat k and vec c = c_1 hat i + c_2 hat j + c_3 hat k . If a_r, b_r and c_ r, where r = 1, 2, 3, are non-negative real numbers and sum_(r=1)^3(a_r+b_r+c_r)=3L show that V le L^3

If b_i=1-a_i ,n a=sum_(i=1)^n a_i ,n b=sum_(i=1)^n b_i ,t h e nsum_(i=1)^n a_i ,b_i+sum_(i=1)^n(a_i-a)^2= a b b. n a b c. (n+1)a b d. n a b

If a_i > 0 for i=1,2,…., n and a_1 a_2 … a_(n=1) , then minimum value of (1+a_1) (1+a_2) ….. (1+a_n) is :

If the arithmetic mean of a_(1),a_(2),a_(3),"........"a_(n) is a and b_(1),b_(2),b_(3),"........"b_(n) have the arithmetic mean b and a_(i)+b_(i)=1 for i=1,2,3,"……."n, prove that sum_(i=1)^(n)(a_(i)-a)^(2)+sum_(i=1)^(n)a_(i)b_(i)=nab .

A.I. Oparin wrote

A.I. Oparin wrote

A path of length n is a sequence of points (x_(1),y_(1)) , (x_(2),y_(2)) ,…., (x_(n),y_(n)) with integer coordinates such that for all i between 1 and n-1 both inclusive, either x_(i+1)=x_(i)+1 and y_(i+1)=y_(i) (in which case we say the i^(th) step is rightward) or x_(i+1)=x_(i) and y_(i+1)=y_(i)+1 ( in which case we say that the i^(th) step is upward ). This path is said to start at (x_(1),y_(1)) and end at (x_(n),y_(n)) . Let P(a,b) , for a and b non-negative integers, denotes the number of paths that start at (0,0) and end at (a,b) . Number of ordered pairs (i,j) where i ne j for which P(i,100-i)=P(i,100-j) is