AI InterviewSearch…Search problems, topics, or pages…Ctrl KGet started
Mediumcombinations

~50s

Handshakes at a party

At a party every person shakes hands exactly once with every other person, making 66 handshakes in all. How many people are there?

Show the answer and the worked solution

Correct answer: B.

12

Worked solution

  1. Handshakes = C(n,2) = n(n − 1)/2 = 66, so n(n − 1) = 132.
  2. 12 × 11 = 132, so n = 12.

Answer: 12.

The idea

Handshakes, matches in a league, diagonals plus sides of a polygon — all are C(n,2). Solve n(n − 1) = 2k by finding consecutive factors.

Shortcut. n(n − 1) = 132 and √132 ≈ 11.5, so n and n − 1 straddle it: 12 × 11 = 132, giving n = 12.

Common trap. 11 — picking the smaller factor of 12 × 11; 11 people make only 11 × 10 ÷ 2 = 55 handshakes.

Handshakes at a party — Aptitude Question

Handshakes at a party: At a party every person shakes hands exactly once with every other person, making 66… Answer and worked solution on CodeKairo.

Question

At a party every person shakes hands exactly once with every other person, making 66 handshakes in all. How many people are there?

Options

  1. 11
  2. 12
  3. 13
  4. 22
Show the answer and the worked solution

Correct answer: B. 12

Worked solution

  1. Handshakes = C(n,2) = n(n − 1)/2 = 66, so n(n − 1) = 132.
  2. 12 × 11 = 132, so n = 12.

Answer: 12.

The idea

Handshakes, matches in a league, diagonals plus sides of a polygon — all are C(n,2). Solve n(n − 1) = 2k by finding consecutive factors.

Shortcut. n(n − 1) = 132 and √132 ≈ 11.5, so n and n − 1 straddle it: 12 × 11 = 132, giving n = 12.

Common trap. 11 — picking the smaller factor of 12 × 11; 11 people make only 11 × 10 ÷ 2 = 55 handshakes.

All Permutations & Combinations questions · placement mock tests