Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

To find the minimum number of students, each of whom comes from one of the 50 states, who must be enrolled in a university to guarantee that there are at least 100 who come from the same state.

Short Answer

Expert verified

\(4951\) students.

Step by step solution

01

Given data

Each student comes from one of the \(99 \times 50 = 4950\) states.

02

Concept used of number of ways to do a task

If a task is complete in\(n1\)ways or\(n2\) ways, then the number of ways to do the task is\(n1 + n2\).

03

Find the number of students

Each student comes from one of the \(50\) states.

We take the least case where we consider to have \(99\) students from each state.

So there are \(99 \times 50 = 4950\) students in the university.

The next final student is the one from any of these \(50\) states so that he is the \({100^{{\rm{th }}}}\) student from that specific state.

Thus, if \(4950 + 1 = 4951\) students are considered, such that there is at least one student from each state, then there is at least one state from which \(100\) students might have come.

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 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 expansion of(x+y)6.

Give a formula for the coefficient ofxkin the expansion of(x2โˆ’1/x)100, where Kis an integer.

In this exercise we will count the number of paths in the\(xy\)plane between the origin \((0,0)\) and point\((m,n)\), where\(m\)and\(n\)are nonnegative integers, such that each path is made up of a series of steps, where each step is a move one unit to the right or a move one unit upward. (No moves to the left or downward are allowed.) Two such paths from\((0,0)\)to\((5,3)\)are illustrated here.

a) Show that each path of the type described can be represented by a bit string consisting of\(m\,\,0\)s and\(n\,\,1\)s, where a\(0\)represents a move one unit to the right and a\(1\)represents a move one unit upward.

b) Conclude from part (a) that there are \(\left( {\begin{array}{*{20}{c}}{m + n}\\n\end{array}} \right)\) paths of the desired type.

How many different permutations are there of the set {a,b,c,d,e,f,g} ?

One hundred tickets, numbered \(1,2,3, \ldots ,100\), are sold to \(100\) different people for a drawing. Four different prizes are awarded, including a grand prize (a trip to Tahiti). How many ways are there to award the prizes if

a) there are no restrictions?

b) the person holding ticket \(47\) wins the grand prize?

c) the person holding ticket \(47\) wins one of the prizes?

d) the person holding ticket \(47\) does not win a prize?

e) the people holding tickets \(19\) and \(47\) both win prizes?

f) the people holding tickets \(19\;,\;47\)and \(73\) all win prizes?

g) the people holding tickets \(19\;,\;47\;,\;73\) and \(97\) all win prizes?

h) none of the people holding tickets \(19\;,\;47\;,\;73\) and \(97\) wins a prize?

i) the grand prize winner is a person holding ticket \(19\;,\;47\;,\;73\) or \(97\)?

j) the people holding tickets 19 and 47 win prizes, but the people holding tickets \(73\) and \(97\) do not win prizes?

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.

Sign-up for free