If there are n people who shake hands with each other exactly once, it can be observed that there are n x (n-1) handshakes.
Since each handshake is counted twice here,we divide this by 2.
Therefore, total number of handshakes is n(n-1)/2.
In the given problem,
Given: Total handshakes =66
i.e n(n-1)/2=66
n2-n =132
n2-n-132=0
(n-12)(n+11)=0
n =12 or n= -11
As handshakes cannot be negative we discard 11 .
Therefore answer is , 12 people.
29 People including You.
371
With 3 people, there are only 3 handshakes: AB, AC, and BC. Where it gets interesting is at a party with, say, 10 people ... 45 handshakes. Or in the US Senate when all 100 Senators are present ... 4,950 handshakes.
If that happens you have to times ninexten and the answer would be 90 handshakes
There will be 28 handshakes. If you ask each person how many handshakes they had they will tell you 7 making 7 x 8 = 56 handshakes in all. But every hand involves two people, so every handshake has been counted twice, thus there are 56 / 2 = 28 handshakes in all.
107 unique handshakes will be exchanged
29 People including You.
So, there will be 3 handshakes among the 3 people at the party.
371
With 3 people, there are only 3 handshakes: AB, AC, and BC. Where it gets interesting is at a party with, say, 10 people ... 45 handshakes. Or in the US Senate when all 100 Senators are present ... 4,950 handshakes.
If that happens you have to times ninexten and the answer would be 90 handshakes
There will be 28 handshakes. If you ask each person how many handshakes they had they will tell you 7 making 7 x 8 = 56 handshakes in all. But every hand involves two people, so every handshake has been counted twice, thus there are 56 / 2 = 28 handshakes in all.
38
If six people meet there are fifteen handshakes.
Sixty-six unique, distinct handshakes.
15
There were ten people at the party. This is a triangular sequence starting with two people: 1, 3, 6, 10, 15, 21, 28, 36, 45, etc. There's an equation for this. With n people at the party, the number of handshakes is n(n-1)/2.