All Exams Test series for 1 year @ ₹349 only
Question

In a group of 11 persons, each shakes hand with every other once and only once. What is the total number of such handshakes?

The correct answer is
55

Handshake Calculation for 11 Persons

This problem involves finding the total number of unique handshakes within a group of 11 individuals, where each person shakes hands with every other person exactly once. This is a classic combinatorics problem.

Identifying the Problem Type

A handshake involves two people. Since shaking hands is mutual (Person A shaking hands with Person B is the same handshake as Person B with Person A), the order does not matter. Therefore, we need to use combinations to find the number of ways to choose 2 people from the group of 11.

Combination Formula

The number of combinations of choosing $k$ items from a set of $n$ items is given by the formula:

$C(n, k) = \binom{n}{k} = \frac{n!}{k!(n-k)!}$

For the handshake problem, we are choosing pairs of people ($k=2$) from the total group ($n=11$).

Alternatively, a simplified formula for the specific case of handshakes ($k=2$) is:

$ \text{Total Handshakes} = \frac{n(n-1)}{2} $

Calculation Steps

  1. Identify the total number of persons: $n = 11$.
  2. Apply the handshake formula: Substitute $n=11$ into the formula $\frac{n(n-1)}{2}$.
  3. Calculate the result: $ \text{Total Handshakes} = \frac{11 \times (11-1)}{2} $ $ \text{Total Handshakes} = \frac{11 \times 10}{2} $ $ \text{Total Handshakes} = \frac{110}{2} $ $ \text{Total Handshakes} = 55 $

Conclusion

The total number of unique handshakes possible in a group of 11 persons, where each person shakes hands with every other person exactly once, is 55.

Was this answer helpful?

Important Questions from Permutation and Combination (Notes)

  1. In how many ways can 10 men be divided into two groups of 4 men and 6 men?
  2. How many 5-digit numbers can be formed from the digits 0, 2, 3, 4, 6, 7 and 9, using each at most once, which are divisible by 5?
  3. In how many ways can you place $N$ coins on a board with $N$ rows and $N$ columns such that every row and every column contains exactly one coin?
  4. From a group of 40 players, a cricket team of 11 players is chosen. Then, one of the eleven is chosen as the captain of the team. The total number of ways this can be done is
    [$\binom{m}{n}$ below means the number of ways $n$ objects can be chosen from $m$ objects]
  5. The maximum number of points formed by intersection of all pairs of diagonals of convex octagon is
Need Expert Advice?

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App