/*! This file is auto-generated */ .wp-block-button__link{color:#fff;background-color:#32373c;border-radius:9999px;box-shadow:none;text-decoration:none;padding:calc(.667em + 2px) calc(1.333em + 2px);font-size:1.125em}.wp-block-file__button{background:#32373c;color:#fff;text-decoration:none} Q. 1.4 A student is to answer 7 out of ... [FREE SOLUTION] | 91Ó°ÊÓ

91Ó°ÊÓ

A student is to answer 7 out of 10 questions in an examination. How many choices has she? How many if she must answer at least 3 of the first 5 questions?

Short Answer

Expert verified

7questions out of 10can be selected in 120ways and if she must answer at least 3out of first 5questions, then 7out of 10 questions can be selected in110ways.

Step by step solution

01

Step 1. Given information.

It is given that,

Total no. of questions =10

No. of questions to be answered =7

02

Step 2. Find the choices of selecting 7 out of 10 questions.

A student can select 7out of 10questions in 107ways

=10!7!3!=10×9×8×7!3×2×1×7!=5×3×8=120

Therefore, the no. of choices for selecting7out of10questions is120.

03

Step 3. Find the choices of selecting 7 out of 10 questions, if at least 3 questions are to be selected from first 5 questions.

Let us divide the total questions in two groups, each group containing 5questions.

If a student selects 3questions from first group then he will select 4questions from the second group. So, the no. of choices will be

5354=5!3!2!×5!4!1!=10×5=50

If a student selects 4questions from first group then he will select 3questions from the second group. So, the no. of choices will be

role="math" localid="1648646922678" 5453=5!4!1!×5!3!2!=5×10=50

If a student selects 5questions from first group then he will select 2questions from the second group. So, the no. of choices will be

5552=5!5!×5!3!2!=1×10=10

Therefore, the no. of choices of selecting 7out of 10questions, if at least 3questions are to be selected from first 5 questions=50+50+10=110

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.

Over 30 million students worldwide already upgrade their learning with 91Ó°ÊÓ!

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

For years, telephone area codes in the United States and Canada consisted of a sequence of three digits. The first digit was an integer between 2 and 9, the second digit was either 0 or 1, and the third digit was any integer from 1 to 9. How many area codes were possible? How many area codes starting with a 4 were possible

1. (a) How many different 7-place license plates are possible if the first 2 places are for letters and the other 5 for numbers? (b) Repeat part (a) under the assumption that no letter or number can be repeated in a single license plate

A committee of 6 people is to be chosen from a group consisting of 7 men and 8 women. If the committee must consist of at least 3 women and at least 2 men, how many different committees are possible?

In how many ways can 8 people be seated in a row if (a) there are no restrictions on the seating arrangement? (b) persons A and B must sit next to each other? (c) there are 4 men and 4 women and no 2 men or 2 women can sit next to each other? (d) there are 5 men and they must sit next to one another? (e) there are 4 married couples and each couple must sit together?

Consider a tournament of ncontestants in which the outcome is an ordering of these contestants, with ties allowed. That is, the outcome partitions the players into groups, with the first group consisting of the players who tied for first place, the next group being those who tied for the next-best position, and so on. Let localid="1648231792067" N(n)denote the number of different possible outcomes. For instance, localid="1648231796484" N(2)=3, since, in a tournament with localid="1648231802600" 2contestants, player localid="1648231807229" 1could be uniquely first, player localid="1648231812796" 2could be uniquely first, or they could tie for first.

(a) List all the possible outcomes when n=3.

(b) With localid="1648231819245" N(0)defined to equal localid="1648231826690" 1, argue without any computations, that localid="1648281124813" N(n)=∑i=1nniNn-i

Hint: How many outcomes are there in which localid="1648231837145" iplayers tie for last place?

(c) Show that the formula of part (b) is equivalent to the following:

localid="1648285265701" N(n)=∑i=1n-1niNi

(d) Use the recursion to find N(3) and N(4).

See all solutions

Recommended explanations on Math Textbooks

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.