Each person shakes hands with every person other than their spouse. Thus, each person shakes hands with 2n-2 people. Hence total handshakes are 2n*(2n-2).
But each handshake is counted twice thus the number of handshakes are:
2n*(n-1)
1. There are n married couples at a party (so, 2n people). Each person shakes hands...
Exercise 1.52. Three married couples (6 guests altogether) attend a dinner party. They sit at a round table randomly in such a way that each outcome is equally likely. What is the probability that somebody sits next to his or her spouse? Hint. Label the seats, the individuals, and the couples. There are 6! 720 seating arrangements altogether. Apply inclusion-exclusion to the events A, [ith couple sit next to each other),-1, 2, 3. Count carefully the numbers of arrangements in...
Exercise 1.52. Three married couples (6 guests altogether) attend a dinner party. They sit at a round table randomly in such a way that each outcome is equally likely. What is the probability that somebody sits next to his or her spouse? Hint. Label the seats, the individuals, and the couples. There are 6! 720 seating arrangements altogether. Apply inclusion-exclusion to the events Ai = (ith couple sit next to each other2, 3. Count carefully the numbers of arrangements in...
please solve 22.1, using the Theorem given. Thank you.
Theorem 22.1. Suppose that n people (n 2 2) are at a party. Then there exist at least two people at the party who know the same number of people present First you need to know the rules. We will assume that no one knows him- or herself. We will also assume that if x claims to know y, then y also knows x. The idea behind the proof is this,...
Bonus 1 A walk in a graph G is a sequence of vertices V1, V2, ..., Uk such that {Vi, Vi+1} is an edge of G. Informally, a walk is a sequence of vertices where each step is taken along an edge. Note that a walk may visit the same vertex more than once. A closed walk is a walk where the first and last vertex are equal, i.e. v1 = Uk. The length of a walk is the number...
10) Five people attended a smaller dinner party. Is it mathematically possible that each person shook hands with exactly 3 people at the dinner? Explain why or why not. (3 points)
There are 101 people at a party. Each person has an even number (possibly zero) of acquaintances. Prove that there are three people at the party with the same number of acquaintances. Is this true if there are only 100 people? Justify your answer. Note that a person cannot be an acquaintance with themself.
Discrete Math Question 1: Answer the following questions using your knowledge of binomial coefficients. Imagine a committee comprised of 7 men and 8 women. a) How many ways can you choose single representative from the committee? b) How many ways can you choose a task force of 3 members from the committee? c) How many ways can you choose a task force of 3 members who will then fit three roles: task force leader, task force vice-leader and task force...
Fifty married couples attend a retreat. The ages of the wife and husband in each relationship is subtracted. Of interest is if people tend to marry others within 5 years of each other. The hypothesis test to use is independent group means, population standard deviations known independent group means, population standard deviations unknown matched or paired samples O two proportions Question 8 1 pts Fifty married couples attend a retreat. The ages of the wife and husband in each relationship...
Problem 1: regarding Binary numbers, create an algorithm (flowchart ) that reads a 4-bit binary number from the keyboard as a string and then converts it into a decimal number. For example, if the input is 1100, the output should be 12. (Hint: Break the string into substrings and then convert each substring to a value for a single bit. If the bits are b0, b1, b2, and b3, the decimal equivalent is 8b0+ 4b1+ 2b2+ b3.) Problem 2: Suppose...
2: Exercise 1.24. There are n married couples arranged at random in a row. 1. Find the probability that no husband sits next to his wife. 2. Compute this probability explicitly when n 3.