wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Question

There are total 17C6k 11C5 ways to get a sum of atmost 17 by throwing six distinct dice ,then k is equal to :

A
4
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
5
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
6
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
D
8
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution

The correct option is C 6
Let x1,x2x6 be the number that appears on the six dice.
Let us find the number of ways to get the sum less than or equal to 17.
This will be same as finding the number of solutions to the inequality x1+x2+x3+...x617
Introducing a dummy variable x7 (x70), the inequality becomes an equation :
1+x2+x3+...x6+x7=17
Here 1xi6 where i=1,2,...6 and x70
Therefore the number of solutions =coeff. of x17 in (x+x2+...+x6)6×(1+x+x2+...)
=coeff. of x11 in (1x6)6(1x)7
=coeff. of x11 in (16x6)(1x)7
= 17C66×11C5

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Multinomial Theorem
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon