Solving Combination Questions: 8 People and Handshakes

  • Thread starter Thread starter Kenny09
  • Start date Start date
  • Tags Tags
    Combination
AI Thread Summary
In a scenario with 8 people shaking hands, each person shakes hands with 7 others, leading to a total of 56 handshakes when calculated as 8 times 7. However, since each handshake involves two people, this method overcounts the total, necessitating a division by 2, resulting in 28 unique handshakes. The discussion also touches on the difference between combinations and permutations, clarifying that the handshake problem primarily involves combinations since the order of shaking hands does not matter. A simpler approach to visualize the problem is to count handshakes incrementally, starting from one person and moving through the group. Ultimately, the handshake problem illustrates the importance of understanding how to correctly count interactions in a group setting.
Kenny09
Messages
9
Reaction score
0

Homework Statement



There're 8 people in the room and each person shakes hand with the other .

Homework Equations



How many hand shakes are there ?

The Attempt at a Solution



One person will shake hand with 7 other people and so on . As a result there should be 8 power of 7 but the result is different ?

P/S : Can you explain what's the difference between combination and permutation ?
 
Physics news on Phys.org
First of all take the easy way!

Let's say that there are 3 people. How many hand shakes actually are, and how many do you calculate with your method?
 
Supposing there're 3 people . One person shakes hand with 2 others ? and there're 9 hand shakes using my method and is it actually 2 hand shakes ? What's the equation for this ?
 
Draw a ring or circle and start arranging equally located points, starting with 3 points on the circle. Now, draw all connecting segments between all points. Count the segments. Continue doing this using 4 points, then 5 points, up until 8 points. You should determine what the resulting number pattern is, and from this, you can determine how many segments will connect any number of equally distributed points around the circle.

This is also known as "the handshake problem", and it has been discussed in the forums previously.
 
It is actually 3 hand shakes. Call the people A, B, C (stupid names! :smile:)

Man A, shakes B and C (2 hand shakes)

Now we don't have to bother with A any more, he/she did his/her job

We are left with B and C (1 hand shake) Total = 3
Ok, up to this?
 
One person will shake hand with 7 other people and so on . As a result there should be 8 power of 7
Does "8 power of 7" mean 87? And how did you arrive at that?

Each person shakes hands with every other person. If there are n people, each person must shake hands with n-1 other people and so there are n(n-1) handshakes. EXCEPT each handshake involves two people so that "overcounts".
 
I actually got it myself . One person shakes hand with 7 others . And there're 8 times of that action ? ( Because we have 8 people ) so 42 ? . But i found it nothing to do with combination nor permutation . What's the difference between them ?

By the way does anybody know what is alpha-numeric plate ?
 
No, you haven't got it. First of all 8(7) is NOT 42, it is 56! If 8 people each shake hands with 7 people that would be 56 handshakes except that two people participate in each handshake- you are counting each handshake twice.

Another way to do it, but more tedious, would be to argue that person "A" shakes hands with each of the other people: 7 handshakes. Person "B" then shakes hands with 6 other people (his handshake with "A" already being counted), then person "C" shakes hands with 6 new people, etc. The number of handshakes is 7+ 6+ 5+ 4+ 3+ 2+ 1.
 

Similar threads

Back
Top