Question:

If nCr denotes the number of combinations of n distinct things taken r at a time, then the domain of the function g (x)= (16-x)C(2x-1)  is

Updated On: Apr 14, 2025
  • {1,2,3,4,5}

  • {0,1,2,3.4}

  • {0}

Hide Solution
collegedunia
Verified By Collegedunia

The Correct Option is A

Solution and Explanation

To solve the problem, we need to determine the domain of the function \( g(x) = \binom{16 - x}{2x - 1} \), where the binomial coefficient is defined only when the upper value is a non-negative integer and the lower value is a non-negative integer ≤ upper value.

1. Understand the Condition for Combinations:
The function involves a binomial coefficient \( \binom{n}{r} \), which is only defined when:
- \( n \in \mathbb{Z}_{\geq 0} \) (i.e., n is a non-negative integer)
- \( r \in \mathbb{Z}_{\geq 0} \) and \( r \leq n \)

2. Apply to the Given Function:
We are given \( g(x) = \binom{16 - x}{2x - 1} \)

3. Set Conditions for Domain:
For the binomial to be defined:
- \( 16 - x \in \mathbb{Z}_{\geq 0} \Rightarrow x \leq 16 \)
- \( 2x - 1 \in \mathbb{Z}_{\geq 0} \Rightarrow x \geq \frac{1}{2} \)
- Also, \( 2x - 1 \leq 16 - x \Rightarrow 3x \leq 17 \Rightarrow x \leq \frac{17}{3} \approx 5.67 \)

4. Find Integer Values Satisfying All Conditions:
We need integer values of \( x \) such that:
- \( \frac{1}{2} \leq x \leq \frac{17}{3} \)
So, possible integer values are: \( x = 1, 2, 3, 4, 5 \)

Final Answer:
The domain of the function is \( \{1, 2, 3, 4, 5\} \)

Was this answer helpful?
49
44

Concepts Used:

Permutations and Combinations

Permutation:

Permutation is the method or the act of arranging members of a set into an order or a sequence. 

  • In the process of rearranging the numbers, subsets of sets are created to determine all possible arrangement sequences of a single data point. 
  • A permutation is used in many events of daily life. It is used for a list of data where the data order matters.

Combination:

Combination is the method of forming subsets by selecting data from a larger set in a way that the selection order does not matter.

  • Combination refers to the combination of about n things taken k at a time without any repetition.
  • The combination is used for a group of data where the order of data does not matter.