MathCastle
Proof Writing & Problem SolvingEasy

Proof Writing & Problem Solving · Easy problem

People arrive at a party one at a time, and each newcomer shakes hands with everyone already there. If H(n)H(n) is the number of handshakes once nn people have arrived, then H(1)=0H(1) = 0 and H(n+1)=H(n)+nH(n + 1) = H(n) + n, and induction gives H(n)=n(n−1)2H(n) = \dfrac{n(n-1)}{2}. How many handshakes are there once 1212 people have arrived?

Practice more like this