Math, asked by niyatitodipcdg85, 1 year ago

can anyone help me with this 2nd question from the chapter permutations and combinations..

Attachments:

niyatitodipcdg85: no .. how come only 8
niyatitodipcdg85: it is 40320
aRKe09: 8! = 8*7*6*5*4*3*2*1 = 40320
aRKe09: you forgot factorial
niyatitodipcdg85: oh ya. .. sorry i didnt see (!) sign on that 8 so sorry
aRKe09: hey no problem
aRKe09: question 2 is not complete
aRKe09: No data about young children us given, so we can't
aRKe09: if one is the youngest , 1 is fixed and then 7 members arranged in 7! ways
aRKe09: 7! = 7*6*5*4*3*2*1 = 5040

Answers

Answered by divergent07
1
may be this is your answer....
Attachments:

Rajdeepsingh192837: hi
niyatitodipcdg85: hello
Rajdeepsingh192837: whats your real name
niyatitodipcdg85: the same
Rajdeepsingh192837: okhh
Rajdeepsingh192837: divergent yours
Answered by Rajdeepsingh192837
0
No of students =8

1. no of ways for sitting arrangments
= 8×7×6×5×4×3×2×1
=40320
2. no of ways of arrangment if youngest one is fixed
=7×6×5×4×3×2×1
= 5040



HOPE IT HELPED
PLEASE MARK IT AS BRAINLIEST

Rajdeepsingh192837: thax
Rajdeepsingh192837: thankx
Similar questions