Home
Class 12
MATHS
The number of sets of three distinct ele...

The number of sets of three distinct elemetns that can be chosen from the set `{2^(1),2^(2),2^(3),…….,2^(200)}` such that the three elements form an increasing geometric progression

A

9900

B

19900

C

9950

D

10000

Text Solution

AI Generated Solution

The correct Answer is:
To solve the problem of finding the number of sets of three distinct elements from the set `{2^(1), 2^(2), 2^(3), …, 2^(200)}` such that the three elements form an increasing geometric progression (GP), we can follow these steps: ### Step 1: Understand the Set and the Condition for GP The set consists of powers of 2, specifically: - \(2^1, 2^2, 2^3, \ldots, 2^{200}\) For three numbers \(2^a, 2^b, 2^c\) (where \(a < b < c\)) to be in geometric progression, they must satisfy the condition: \[ 2b = a + c \] This means that the middle term \(2^b\) must be the geometric mean of the first and last terms \(2^a\) and \(2^c\). ### Step 2: Express the Condition in Terms of Indices From the GP condition: \[ 2b = a + c \] We can rearrange this to find \(b\): \[ b = \frac{a + c}{2} \] This implies that \(a + c\) must be even, which means \(a\) and \(c\) must either both be odd or both be even. ### Step 3: Count Odd and Even Indices The indices range from 1 to 200. - Odd indices: \(1, 3, 5, \ldots, 199\) (Total: 100 odd numbers) - Even indices: \(2, 4, 6, \ldots, 200\) (Total: 100 even numbers) ### Step 4: Choose Indices for GP To form a valid GP: 1. **Choose two odd indices \(a\) and \(c\)**: - The number of ways to choose 2 odd indices from 100 is given by: \[ \binom{100}{2} \] 2. **Choose two even indices \(a\) and \(c\)**: - The number of ways to choose 2 even indices from 100 is also: \[ \binom{100}{2} \] ### Step 5: Calculate Total Combinations The total number of sets of three distinct elements that can be chosen is the sum of the combinations from odd and even indices: \[ \text{Total} = \binom{100}{2} + \binom{100}{2} \] Calculating \(\binom{100}{2}\): \[ \binom{100}{2} = \frac{100 \times 99}{2} = 4950 \] Thus, the total number of sets is: \[ \text{Total} = 4950 + 4950 = 9900 \] ### Final Answer The number of sets of three distinct elements that can be chosen from the set such that they form an increasing geometric progression is **9900**. ---
Promotional Banner

Topper's Solved these Questions

  • PERMUTATIONS & COMBINATIONS

    FIITJEE|Exercise ASSIGNMENT PROBLEMS (OBJECTIVE) LEVEL II|23 Videos
  • PERMUTATIONS & COMBINATIONS

    FIITJEE|Exercise COMPREHENSIONS|9 Videos
  • PERMUTATIONS & COMBINATIONS

    FIITJEE|Exercise ASSIGNMENT PROBLEMS (SUBJECTIVE) LEVEL -II|15 Videos
  • PARABOLA

    FIITJEE|Exercise NUMERICAL BASED|5 Videos
  • PROBABILITY

    FIITJEE|Exercise Exercise 7|2 Videos

Similar Questions

Explore conceptually related problems

Find the number of ways in which 3 distinct numbers can be selected from the set {3^(1),3^(2),3^(3),..,3^(100),3^(101)} so that they form a G.P.

Two distinct numbers a and b are chosen randomly from the set {2,2^(2),2^(3),….2^(25)} . Then the probability that log_(a)b is an integer is

Statement 1: The number of ways in which three distinct numbers can be selected from the set {3^(1),3^(2),3^(3),3^(100),3^(101)} so that they form a G.P.is 2500. Statement 2: if a,b,c are in A.P.then 3^(a),3^(b),3^(c) are in G.P.

Two distinct numbers a and b are chosen randomly from the set {2,2^(2),2^(3),2^(4),......,2^(25)}. Find the probability that log _(a)b is an integer.

The number of distinct values of a2xx2 determinant whose entries are from the set {-1,0,1}, is

The number of ways three different natural numbers cab be drawn from the set {1, 2, 3, 4,……….., 10} , if minimum of the chosen numbers is smaller than 4, is

Statement-1: The total number of ways in which three distinct numbers in AP, can be selected from the set {1,2,3, . .,21}, is equal to 100. Statement-2: If a,b,c are inn AP, then a+c=2b.

If one quarter of all three element subsete of the set A={a_(1),a_(2),a_(3),......,a_(n)} contains the element a_(3) , then n=

The number of ways in which three numbers in arithmetic progression can be selected from {1, 2, 3, ………., 50} is

FIITJEE-PERMUTATIONS & COMBINATIONS-ASSIGNMENT PROBLEMS (OBJECTIVE) LEVEL I
  1. The number of flags with three strips in order, that can be formed usi...

    Text Solution

    |

  2. The number of rational numbers lying in the interval (2002,2003) all w...

    Text Solution

    |

  3. The number of sets of three distinct elemetns that can be chosen from ...

    Text Solution

    |

  4. In a group of boys, two boys are brothers and six more boys are pre...

    Text Solution

    |

  5. There are four pairs of shoes of different sizes. Each of the 8 shoes ...

    Text Solution

    |

  6. There are m copies each ofn different books in a university library. T...

    Text Solution

    |

  7. The value of (sum(i=0)^(100).^(k)C(1).^(m-k)C(100-i)((k-i)/(m-100)))/(...

    Text Solution

    |

  8. Number of natural numbers lt2.10^(4), which can be formed with the dig...

    Text Solution

    |

  9. The letters of the word DRAWER are arranged in alphabeticla ordr. The ...

    Text Solution

    |

  10. The number of permuta!ons of the letters of the word HINDUSTAN such th...

    Text Solution

    |

  11. 4 points out of 8 points in a plane are collinear. Number of different...

    Text Solution

    |

  12. Find the three-digit odd numbers that can be formed by using the digit...

    Text Solution

    |

  13. The number of divisors of 3630, which have a remainder of 1 when divid...

    Text Solution

    |

  14. The number of ways in which 15 boys and 2 girls can sit in a row such ...

    Text Solution

    |

  15. The number of rational numbers p/q, where p, q in [1,2,3, 4,5, 6} is

    Text Solution

    |

  16. Let S={1,2,3,....., 100}. The number of non-empty subsets A of S such ...

    Text Solution

    |

  17. On a railway there are 20 stations. The number of different tickets re...

    Text Solution

    |

  18. .^(n)C(r)+2.^(n)C(r-1)+.^(n)C(r-2)=

    Text Solution

    |

  19. How many different nine digit numbers can be formed from the numebr 22...

    Text Solution

    |

  20. A seven-digit number without repetition and divisible by 9 is to be...

    Text Solution

    |