There are n people in a room. Each person will shake hands with every other person once and only once. How many hand shakes will there be?
it depends on how many people are shaking thier hands
n=2
There is one handshake
n=3
3 handshakes
n=4
Each person shakes hands with 3(=n-1) others. There are 4(=n) people in all, that makes 3*4 handshakes each counted twice, so there are 6 handshakes.
n=5
There are 10 handshakes.
Can you figure out the number of handshakes for n persons?
Lets look at a typical problem with real numbers.
If there are 15 people in a room and each person shakes hands with every other person in the room only once, how many handshakes will take place?
There are two ways of looking at this type of problem. The first involves determining the number of combinations of "n" things taken "r" at a time and the other the sum of all possible pairings of "n" things.
For the first method, what you are seeking is the number of possible combinations of 15 people taken two at a time with no combination being repeated in another order. What I mean here is that once "a" shakes the hand of "b", then that pairing has been made and cannot be repeated in the form of "b" shaking the hand of "a" at another time. Only the single pairings are counted. This then boils down to determining the number of possible combinations of "n" different things taken "r" at a time, C(n,r), which is derivable from the formula C(n,r) = [n(n-1)(n-2)-----(n-r+1)/r! = n!/[r!(n-r)!], where n! = n(n-1)(n-2)------(3)(2)(1), r! means r(r-1)(r-2) etc., and similarly for (n-r)!. So in your problem n = I15 and r = 2. Thus you have C(15,2) = [15x14x13----3x2x1]/(2x1)(13x12x11----3x2x1) = 15x14/2x1 = 210/2 = 105 handshakes.
The second method seeks the sum of all possible pairings between the n people as follows, using 5 people to illustrate the derivation. Person 1 shakes the hand of 4 other people. Person 2 shakes the hands of 3 other people already having shaken the hand of person 1. Person 3 shakes the hands of 2 other people already having shaken the hands of persons 1 and 2. Person 4 shakes the hand of person 5, also having already shaken the hands of persons 1, 2, and 3. So what do we have in the way of a total? All together, 4 + 3 + 2 +1 = 10.
What we did in fact is simply sum up the numbers from 4 to 1, or (n - 1) to 1. Now, the sum of any sequence of consecutive numbers from one on up is given by S = n(n + 1)/2. Notice that our sum starts with (n - 1). Therefore, the total number of handshakes between "n" people can be defined as S = [(n - 1)(n - 1 + 1)]/2 or (n(n - 1)/2.
Applying this to our 15 person problem, S = 15(14)/2 = 210/2 = 105 handshakes.
To find the number of handshakes, we can use a simple formula.
Let's consider a scenario with 3 people: A, B, and C. A will shake hands with B and C; B will shake hands with A and C; and C will shake hands with A and B. So, there will be 3 handshakes.
Similarly, for 4 people: A, B, C, and D. A will shake hands with B, C, and D; B will shake hands with A, C, and D; C will shake hands with A, B, and D; and D will shake hands with A, B, and C. We have a total of 6 handshakes.
From these examples, it becomes clear that for every additional person, each person will shake hands with every other person except themselves. So, for n people, each person will shake hands with (n-1) other people.
Since n people will each shake hands with (n-1) other people, we just need to determine how many pairs of people there are in the room.
In a group of n people, the number of pairs is given by the combination formula nC2, which can be calculated as n! / (2!(n-2)!), where "!" denotes factorial. This formula accounts for the fact that the order of the pairs does not matter.
Using this formula, we can calculate the number of handshakes.