What is the formula for the handshake problem?
how many handshakes required between \(n\) different people?
I have answered your previous two questions. nC2 is the formula.
6 people and everyone shakes with each other once.
indeed, it's just the number of distinct pairs of people you can make i.e. \(\dbinom{n}2=\dfrac{n!}{2!(n-2)!}\)
the "secret" handshake =)
In how many ways can two people be chosen out of 6? nC2 ways.
So can you fill the variables so I can see?
6C2 ways
notice$$\frac{n!}{2!(n-2)!}=\frac{n(n-1)}2$$ ways... just let \(n=6\)
it's trivial to show that if we cared about who initiated each handshake, then each of the \(n\) people would need to initiate \(n-1\) handshakes so that answer would be \(n(n-1)\) (by the fundamental principle of counting). since we don't care who initiates each handshake, we're actually counting exactly *twice* as many handshakes as necessary hence \(n(n-1)/2\) is our final answer. for \(n=6\) we have 6 people who each initiates handshakes with 5 others so \(6\times5=30\) handshakes. but this means that A shakes B's hand and B shakes A's hand so we're actually counting twice as many handshakes as needed so we divide by \(2\) like above: $$30/2=15$$
thx!
Join our real-time social learning platform and learn together with your friends!