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

In the 17th century, there were more than 800,000 inhabitants of Paris. At the time, it was believed that no one had more than 200,000 hairs on their head. Assuming these numbers are correct and that everyone has at least one hair on their head (that is, no one is completely bald), use the pigeonhole principle to show, as the French writer Pierre Nicole did, that there had to be two Parisians with the same number of hairs on their heads. Then use the generalized pigeonhole principle to show that there had to be at least five Parisians at that time with the same number of hairs on their heads.

Short Answer

Expert verified

The resultant answer is that Pierre Nicole assumption was correct.

Step by step solution

01

Given data

There are more than 800,000 inhabitants of Paris is the given expression.

02

Concept of Pigeonhole principle

If the number of pigeons exceeds the number of pigeonholes, at least one hole will hold at least two pigeons, according to the pigeon hole principle.

03

Simplify the expression

There were more than 800,000 inhabitants of Paris, and all of them had less than 200,000 hairs on their head, but no less than one hair. This means that there were more than 800,000 pigeons and less than 200,000 pigeonholes.

Thus, at least \(\left[ {\frac{{800,001}}{{199,999}}} \right] = 5\) people had the same number of hairs, which also proves that the French writer Pierre Nicole's assumption was correct.

Therefore, the Pierre Nicole assumption was correct.

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

Show that (pโ†’r)โˆจ(qโ†’r)and are logically equivalent

How many solutions are there to the equation x1+x2+x3+x4=17wherex1+x2+x3+x4are nonnegative integers?

How many permutations of the letters \(ABCDEFGH\) contain

a) the string \(ED\)?

b) the string \(CDE\)?

c) the strings \(BA\) and \(FGH\)?

d) the strings \(AB\;,\;DE\) and \(GH\)?

e) the strings \(CAB\) and \(BED\)?

f) the strings \(BCA\) and \(ABF\)?

What is meant by a combinatorial proof of an identity? How is such a proof different from an algebraic one?

This procedure is used to break ties in games in the championship round of the World Cup soccer tournament. Each team selects five players in a prescribed order. Each of these players takes a penalty kick, with a player from the first team followed by a player from the second team and so on, following the order of players specified. If the score is still tied at the end of the 10 penalty kicks, this procedure is repeated. If the score is still tied after 20 penalty kicks, a sudden-death shootout occurs, with the first team scoring an unanswered goal victorious.

a) How many different scoring scenarios are possible if the game is settled in the first round of 10 penalty kicks, where the round ends once it is impossible for a team to equal the number of goals scored by the other team?

b) How many different scoring scenarios for the first and second groups of penalty kicks are possible if the game is settled in the second round of 10 penalty kicks?

c) How many scoring scenarios are possible for the full set of penalty kicks if the game is settled with no more than 10 total additional kicks after the two rounds of five kicks for each team?e1โˆ’1โˆ’x2

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