Forty-five handshakes at a party of ten — 4950 at a party of a hundred

The pairing count n(n − 1)/2, and the ordered version that exposes the division.

Statistics and data · Level: Classic result · Updated on 2026-11-10

A hundred people can form (100·99)/2 pairs, which is 4950 — so a party at which everyone shakes hands with everyone else produces 4950 handshakes. Drop the division and you get 9900, which counts something else: ordered pairs, where A greeting B and B greeting A are two events.

The 100·99/2 shape reappears wherever the number of interactions matters rather than the number of participants: network links, comparison sorts, the birthday problem's 23 people giving 253 pairs. Each new guest adds handshakes equal to everyone already in the room, which is why the total is the sum 1 + 2 + … + 99 — the same triangular number that Gauss's anecdote sums.

Answer

4950

How to read it

The unordered count. The workbench's 100 × 99 gives 9900, the ordered version — exactly double.

Source

The number of edges of the complete graph K_n is n(n − 1)/2, the triangular numbers A000217; the party form is the standard counting argument

Work it in the calculator

These links open the right calculator with this problem's numbers already typed in. The line above is what the screen should show — check it yourself.

This is an independent third-party tool site. It is not affiliated with, sponsored by, or authorised by Casio, Texas Instruments or their distributors. Model names and product names are trademarks of their respective owners and appear here only to identify devices.

The keystroke sequences in these manuals were written from this site's own layout data — the same data the online calculator renders — plus publicly available product facts. Specifications and regional configurations are confirmed against the physical device and the manufacturer's most recent material.