Chapter 1: Problem 13
Consider a group of 20 people. If everyone shakes hands with everyone else, how many handshakes take place?
/*! 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}
Learning Materials
Features
Discover
Chapter 1: Problem 13
Consider a group of 20 people. If everyone shakes hands with everyone else, how many handshakes take place?
All the tools & learning materials you need for study success - in one app.
Get started for free
Consider a tournament of \(n\) contestants 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 that tied for first place, the next group being those that tied for the next best position, and so on. Let \(N(n)\) denote the number of different possible outcomes. For instance, \(N(2)=3\) since in a tournament with 2 contestants, player 1 could be uniquely first, player 2 could be uniquely first, or they could tie for first. (a) List all the possible outcomes when \(n=3\). (b) With \(N(0)\) defined to equal 1 , argue, without any computations, that $$ N(n)=\sum_{i=1}^{n}\left(\begin{array}{l} n \\ i \end{array}\right) N(n-i) $$ HINT: How many outcomes are there in which \(i\) players tie for last place? (c) Show that the formula of part (b) is equivalent to the following: $$ N(n)=\sum_{i=0}^{n-1}\left(\begin{array}{l} n \\ i \end{array}\right) N(i) $$ (d) Use the recursion to find \(N(3)\) and \(N(4)\).
If 12 people are to be divided into 3 committees of respective sizes 3,4, and 5 , how many divisions are possible?
In how many ways can \(r\) objects be selected from a set of \(n\) if the order of selection is considered relevant?
Consider \(n\)-digit numbers where each digit is one of the 10 integers 0 , \(1, \ldots, 9 .\) How many such numbers are there for which (a) no two consecutive digits are equal; (b) 0 appears as a digit a total of \(i\) times, \(i=0, \ldots, n\) ?
Present a combinatorial explanation of why \(\left(\begin{array}{l}n \\\ r\end{array}\right)=\left(\begin{array}{c}n \\ r, n-r\end{array}\right)\)
What do you think about this solution?
We value your feedback to improve our textbook solutions.