Analyzing the Setup
The given equation is 6⋅35Cr=(k2−3)⋅36Cr+1, where k is an integer and r is a non-negative integer. In JEE Advanced problems, we avoid brute-force factorial expansion in favor of recursive identities.
We utilize the identity:
nCr=rn⋅n−1Cr−1
By applying this to the right side of the equation, we transform
36Cr+1 into:
r+136⋅35Cr
The Magic of Cancellation
Substituting this back into our original expression, we obtain:
6⋅35Cr=(k2−3)⋅r+136⋅35Cr
Since
35Cr is strictly positive for valid
r, we divide both sides by
35Cr to simplify the expression:
6=(k2−3)⋅r+136
Dividing both sides by 6, we isolate the relationship between
k and
r:
1=(k2−3)⋅r+16⇒k2=6r+1+3
The Constraint Hunt
We know the constraint 0≤r≤35, which implies 1≤r+1≤36. Since k is an integer, k2 must be an integer, forcing (r+1) to be a multiple of 6.
The possible values for (r+1) in the range [1,36] are {6,12,18,24,30,36}. We test these to find perfect squares for k2:
If r+1=6, then k2=66+3=4, yielding k=±2.
If r+1=12, then k2=2+3=5 (not a square).
If r+1=18, then k2=3+3=6 (not a square).
If r+1=24, then k2=4+3=7 (not a square).
If r+1=30, then k2=5+3=8 (not a square).
If r+1=36, then k2=6+3=9, yielding k=±3.
The Final Count
We have identified the valid cases for the ordered pairs (r,k):
1. For r+1=6 (r=5), we have (5,2) and (5,−2).
2. For r+1=36 (r=35), we have (35,3) and (35,−3).
This results in a total of four valid ordered pairs. Through the application of symmetry and logical constraints, we have successfully navigated the complexity of the equation.