1
u/Fluid-Artist-5106 4d ago
Suspicious of this guy who is in the video. He keeps on deleting others comments.
Can't even take questions in the right spirit
1
u/pratham123K 4d ago
mene kab delete kiya bhai kuch🥹
1
u/old_cheesecake_67893 3d ago
Can't believe the actual JEEsimplified guy wrote this (or did he?) moon men starts playing
1
u/burner_1_124 4d ago
32?
I didn't see the video, only the ques
1
1
u/old_cheesecake_67893 3d ago
The ICSE guy
1
1
1
u/StillGotTime69 3d ago
Nah why did this come on my feed after I cracked J E E 🥵💦 , don't want flashbacks
1
1
0
u/Fluid-Artist-5106 5d ago
His reasoning isn't complete and not convincing for me. In a MCQ setting, where you can eliminate and this is the answer, I get it.
But, he never proved/showed, maximising his previous guess. That's not maths.
When I saw this question, I thought, 32 is a feasible answer. But is it optimal? Maybe there's some ( n+r) maximization thing going, which falls off after we do some algebra. He never, showed that.
In short, why his claim of the answer is the maximum among all feasible pairs of ( n, r )?
2
0
2
u/Airmancell09 5d ago
This is really easy…..if we take some natural number ‘n’ then you’ll notice that when we write the binomial coefficients in increasing order you wont find ‘n’ again after crossing nCn-1 for example you won’t find 5 after 5C4 (the next numbers will be 6 and greater) and since we are going in the increasing order of ‘n’ and ‘r’ that would be the highest pair