Handshake Problem — Definition, Formula & Examples

The Handshake Problem asks: if every person in a group shakes hands exactly once with every other person, how many handshakes happen in total? It is one of the most common introductions to combinatorics.

Given $n$ people where each pair shakes hands exactly once, the total number of handshakes equals the number of ways to choose 2 people from $n$ , which is $\binom{n}{2} = \frac{n(n-1)}{2}$ .

Key Formula

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

Where:

$n$ = The number of people in the group

How It Works

Each person could shake hands with

n - 1

others, giving

n(n-1)

handshakes at first glance. But this double-counts every handshake because when person A shakes with person B, that is the same handshake as person B shaking with person A. Dividing by 2 removes the duplicates. The result,

\frac{n(n-1)}{2}

, is identical to the combination formula

\binom{n}{2}

because you are simply choosing 2 people from the group.

Worked Example

Problem: There are 8 people at a party. If every person shakes hands exactly once with every other person, how many handshakes occur?

Identify n: There are 8 people, so

n = 8

Apply the formula: Substitute into the handshake formula.

\frac{8(8-1)}{2} = \frac{8 \times 7}{2}

Calculate: Simplify the expression.

\frac{56}{2} = 28

Answer: There are 28 handshakes in total.

Why It Matters

The Handshake Problem appears in network design, sports scheduling (round-robin tournaments), and computer science whenever you need to count unique pairs. Mastering it builds a concrete foundation for the combination formula used throughout algebra, probability, and statistics courses.

Common Mistakes

Mistake: Forgetting to divide by 2 and answering

n(n-1)

instead of

\frac{n(n-1)}{2}

Correction: Every handshake involves two people, so each gets counted twice in

n(n-1)

. Always divide by 2 to eliminate the double-count.