The number of sequences in which 7 players can throw a ball, so that the youngest player may not be the last is -.
Correct answer: C. 4320
- A. 4000
- B. 2160
- C. 4320
- D. 5300
Explanation
The 7 players can throw in 7! = 5040 sequences. If the youngest is last, the other 6 can be arranged in 6! = 720 ways, so sequences in which the youngest is not last equal 5040 - 720 = 4320 sequences. The likely trap is 5040, which includes the forbidden sequences with the youngest player last.
Last updated
About Sequences and Series
Sequences describe ordered terms formed by a pattern, while series represent the sum of those terms. Questions cover arithmetic and geometric sequences, their nth terms, common difference or ratio, finite sums, and applications, with the sequence itself kept distinct from the corresponding series.
Practise Algebra
269 free Algebra MCQs from Mathematics, each with the correct answer and an explanation. Unlimited attempts, no account needed.
Exams that ask Mathematics questions like this
Mathematics is on 67 papers prepared for on TestUstad, and all of them draw the same bank, so this question is worth knowing for every one of them.