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

Show that among any group of 20 people (where any two people are either friends or enemies), there are either four mutual friends or four mutual enemies.

Short Answer

Expert verified

The resultant answer is, in a group of 20 people (where two people are either friends or enemies), there are four mutual enemies or four mutual friends.

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

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

01

Given data

The given expression is, in a group of 10 people (where two people are either friends or enemies), there are either three mutual friends or four mutual enemies, and there are either three mutual enemies or four mutual friends.

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

Find the possible combinations for group X and Y

Let us divide the group of 20 people in Group X with the first 10 people and Group Y with the second 10 people. By the result, Group X and Group Y both have either three mutual friends. For four mutual enemies E (\(3F\) or \(4{\rm{E}}\) ), and there are either three mutual enemies or four mutual friends (\(3E\) or \(4\;{\rm{F}}\) ).

The possible combinations for group \({\rm{X}}\) and \({\rm{Y}}\) are then:

\(3F\)or \(4{\rm{E}}\), \(3F\) or \(4{\rm{E}}\) …… (1)

\(3F\)or \(4{\rm{E}}\), \(3E\) or \(4\;{\rm{F}}\) …… (2)

\(3F\)or \(4{\rm{E}}\), \(3F\) or \(4{\rm{E}}\) …... (3)

\(3F\)or \(4{\rm{E}}\), \(3E\) or \(4\;{\rm{F}}\) ..…. (4)

It then needs to show that it has 4 mutual friends or 4 mutual enemies in each case.

04

Simplify first and second equation

First equation: \(3F\) or \(4{\rm{E}}\), \(3F\) or \(4{\rm{E}}\) "or" indicates that one of the two statements has to be true:

\(\begin{array}{l}(3F,3F) \Rightarrow 6{\rm{ mutual friends }}\\(3F,4E) \Rightarrow 4{\rm{ mutual enemies }}\\(4E,3F) \Rightarrow 8{\rm{ mutual enemies }}\\(4E,4E) \Rightarrow 8{\rm{ mutual enemies }}\end{array}\)

It then notes that, in each option, it has 4 mutual friends or 4 mutual enemies.

Second case: \(3F\) or \(4{\rm{E}}\), \(3E\) or \(4\;{\rm{F}}\) "or" indicates that one of the two statements has to be true: \((3F,3E) \Rightarrow 12\) people ( 6 pairs) and thus there exist at least one more pair of students among the remaining 8 people that is either friends or enemies

\(4\)mutual friends or \(4\) mutual enemies:

\((3F,4F) \Rightarrow 4\)mutual friends

\((4E,3E) \Rightarrow 4\)mutual enemies

\((4E,4F) \Rightarrow 4\)mutual enemies

It then notes that, in each option, it has 4 mutual friends or 4 mutual enemies.

05

Simplify third and fourth equation

Third case: \(3F\) or \(4{\rm{E}}\), \(3F\) or \(4{\rm{E}}\)"or" indicates that one of the two statements has to be true:

\[(3E,3F) \Rightarrow 12{\rm{ people ( }}6{\rm{ pairs)}}\]and thus, there exist at least one more pair of students among the remaining 8 people that is either friends or enemies.

\(4\)mutual friends or \(4\) mutual enemies:

\(\begin{array}{l}(3E,4E) \Rightarrow 4{\rm{ mutual enemies }}\\(4F,3F) \Rightarrow 4{\rm{ mutual friends }}\\(4F,4E) \Rightarrow 4{\rm{ mutual friends}}\end{array}\)

It then notes that, in each option, it has 4 mutual friends or 4 mutual enemies.

Fourth case: \(3F\) or \(4{\rm{E}}\), \(3E\) or \(4\;{\rm{F}}\)"or" indicates that one of the two statements has to be true:

\[\begin{array}{l}(3E,3E) \Rightarrow 6{\rm{ mutual enemies }}\\(3E,4F) \Rightarrow 4{\rm{ mutual friends }}\\(4F,3E) \Rightarrow 4{\rm{ mutual friends }}\\(4F,4F) \Rightarrow 8{\rm{ mutual friends}}\end{array}\]

It then notes that, in each option, it has 4 mutual friends or 4 mutual enemies.

Hence, the resultant answer is, in a group of 20 people (where two people are either friends or enemies), there are four mutual enemies or four mutual friends.

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

How many bit strings of length \({\rm{10}}\) over the alphabet \({\rm{\{ a,b,c\} }}\) have either exactly three \({\rm{a}}\)s or exactly four \({\rm{b}}\)s?

a) How many ways are there to deal hands of five cards to six players from a standard 52-card deck?

b) How many ways are there to distribute n distinguishable objects into kdistinguishable boxes so thatniobjects are placed in box i?

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?e11x2

Let\(n\)be a positive integer. Show that\(\left( {\begin{array}{*{20}{c}}{2n}\\{n + 1}\end{array}} \right) + \left( {\begin{array}{*{20}{c}}{2n}\\n\end{array}} \right) = \left( {\begin{array}{*{20}{c}}{2n + 2}\\{n + 1}\end{array}} \right)/2\).

How many ways are there for eight men and five women to stand in a line so that no two women stand next to each other? (Hint: First position the men and then consider possible positions for the women.)

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