Log out Go to App
Go to App

Learning Materials

Features

Discover

Chapter 5: Problem 424

A student is to answer 10 out of 13 questions in an examination such that he must choose at least 4 from the first five questions. The number of choice available to him is (a) 140 (b) 196 (c) 180 (d) 346

Short Answer

Expert verified
The number of choices available to the student is \(( _5 C _4 * _8 C _6 ) + ( _5 C _5 * _8 C _5 ) = (5 * 28) + (1 * 56) = 196\). Hence, the correct answer is (b) 196.

Step by step solution

01

Case 1: The student answers exactly 4 out of the first 5 questions.

In this situation, the student will choose 4 out of the first 5 questions and the remaining 6 questions out of the last 8 questions. We can calculate this using combinations: Number of ways to choose 4 out of 5 questions: \( _5 C _4 \) Number of ways to choose 6 out of the last 8 questions: \( _8 C _6 \) Total number of ways in this case: \( _5 C _4 * _8 C _6 \)
02

Case 2: The student answers all 5 out of the first 5 questions.

In this situation, the student will choose all 5 out of the first 5 questions and the remaining 5 questions out of the last 8 questions. We can calculate this using combinations: Number of ways to choose 5 out of 5 questions: \( _5 C _5 \) Number of ways to choose 5 out of the last 8 questions: \( _8 C _5 \) Total number of ways in this case: \( _5 C _5 * _8 C _5 \)
03

Total number of choices available:

To find the total number of choices, we sum the number of ways in both cases: Total choices = (Number of ways in Case 1) + (Number of ways in Case 2) Total choices = \(( _5 C _4 * _8 C _6 ) + ( _5 C _5 * _8 C _5 ) \) Now, we will compute the value for each combination and then add them up to get the final answer: \( _5 C _4 = \frac{5!}{4!1!} = 5 \) \( _8 C _6 = \frac{8!}{6!2!} = 28 \) \( _5 C _5 = \frac{5!}{5!0!} = 1 \) \( _8 C _5 = \frac{8!}{5!3!} = 56 \) Total choices = (5 * 28) + (1 * 56) Total choices = 140 + 56 Total choices = 196 The correct answer is (b) 196. The student has 196 different choices on how to answer the examination questions.

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Start your free trial

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Find the number of chords that can be drawn through 16 points on a circle. (a) 102 (b) 120 (c) 12 (d) \({ }^{16} \mathrm{P}_{2}\)

Three boys and three girls are to be seated around a round table in a circle. Among them the boy \(\mathrm{X}\) does not want any girl neighbour and the girl \(\mathrm{Y}\) does not want any boy neighbour then the no. of arrangement is (a) 2 (b) 4 (c) 23 (d) 33

If a polygon has 90 diagonals, the no. of its sides is given by (a) 12 (b) 11 (c) 10 (d) 15

In a circus there are 10 cages for accommodating 10 animals out of these 4 cages are so small that five out of ten animals can not enter into them. In how many ways will it be possible to accommodate 10 animals in these 10 cages? (a) 66400 (b) 86400 (c) 96400 (d) 46900

The number of ways in which in a necklace can be formed by using 5 identical red beads and 6 identical black beads is (a) \([(11 !) /(6 ! 4 !)]\) (b) \({ }^{11} \mathrm{P}_{6}\) (c) \([(10 !) /(2(6 ! 5 !)]\) (d) None of these
See all solutions

Recommended explanations on English Textbooks

Sociolinguistics

Read Explanation

Essay Prompts

Read Explanation

Phonology

Read Explanation

Lexis and Semantics Summary

Read Explanation

Morphology

Read Explanation

Multiple Choice Questions

Read Explanation
View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free