Question
The number of ordered pairs (r, k) for which 6. 35 C r = (k 2 - 3). 36 C r + 1 , where k is an integer, is :
Options
Solution
Key Concepts and Formulas
- Binomial Coefficient Definition:
- Adjacent Binomial Coefficient Relation:
- Integer Constraints: Understanding when binomial coefficients are defined and the implications of k being an integer.
Step-by-Step Solution
Step 1: Understand the given equation and define the domain for .
The given equation is: For the binomial coefficients to be defined, we need for and for , which gives . Combining these, we have . We are also given that is an integer.
Explanation: Defining the range of possible values for is crucial to ensure we only consider valid solutions.
Step 2: Apply the combination identity for simplification.
We use the identity with : Substituting this into the original equation:
Explanation: This substitution allows us to cancel out the term, simplifying the equation.
Step 3: Rearrange the equation to isolate .
Since for , we can divide both sides by : Multiply both sides by : Divide both sides by 36:
Explanation: Isolating allows us to establish a direct relationship between and , which we can then use to find integer solutions for .
Step 4: Analyze conditions for integer .
Since is an integer, is a non-negative perfect square. Thus, must be an integer. Therefore, must be an integer. This implies must be a multiple of 6.
Also, since , . From the expression , and knowing , we have . So, . Combining these, must be greater than or equal to -3. But since must be an integer, must be an integer.
Furthermore, . Since must be a perfect square, must be a perfect square.
Explanation: These conditions are essential for ensuring that is an integer.
Step 5: Find possible values of .
From Step 1, we know . This means . Since must be a multiple of 6 (from Step 4), the possible values for are: .
Let's find the corresponding values for :
- If
- If
- If
- If
- If
- If
All these values of are within the valid domain .
Explanation: We systematically find all possible values of that satisfy the divisibility condition.
Step 6: Determine corresponding values and count ordered pairs.
For each valid , we calculate and then . We only accept cases where is a perfect square.
-
For : . So, and are solutions.
-
For : . Not an integer, so no solution.
-
For : . Not an integer, so no solution.
-
For : . Not an integer, so no solution.
-
For : . Not an integer, so no solution.
-
For : . So, and are solutions.
Therefore, the ordered pairs are . There are 4 such ordered pairs.
Explanation: We explicitly check each possible value of to determine if it yields integer values for .
Common Mistakes & Tips
- Remember to check for both positive and negative values of when taking the square root.
- Always ensure that the values of you obtain are within the valid range determined by the binomial coefficients.
- Don't forget the fundamental definition of binomial coefficients and when they are valid.
Summary
We simplified the given equation using the adjacent binomial coefficient relation. We then found the possible values of by enforcing the condition that must be an integer. Finally, we verified which of these values of actually resulted in integer values of , counting the number of ordered pairs. The number of ordered pairs is 4.
Final Answer
The final answer is \boxed{4}, which corresponds to option (D).