Loading [MathJax]/jax/output/SVG/jax.js
 
+0  
 
0
4483
3
avatar

At a party, everyone shook hands with everybody else. There were 66 handshakes. How many people were at the party?

 Feb 25, 2015

Best Answer 

 #3
avatar+118696 
+5

At a party, everyone shook hands with everybody else. There were 66 handshakes. How many people were at the party?

 

Mmm

Let there be k people at the party.

The first person shook with k-1 people.

the second with a further k-2 people

the kth person did not shake with anyone new.

So the number of handshakes was

1+2+3+.....+(k-1)

this is the sum of an AP       S=n/2(a+L) =  k12(1+(k1))=k(k1)2

 

so

k(k1)2=66k(k1)=132k2k132=0

 

k2k132=0{k=12k=11}

 

Obviously there is not a neg number of people so there must be 12 people.

 Feb 25, 2015
 #1
avatar
0

can you even solve that

 Feb 25, 2015
 #2
avatar+130458 
+5

We can solve this by this "formula"

n(n-1)/ 2 = 66    multiply by 2 on each side

n(n-1) = 132   simplify and rearrange

n^2 - n - 132 = 0    factor

(n - 12) (n+11) = 0    and setting  each factor to 0, we have that n = 12 and n = -11

Reject the negative

n = 12 people

We can see this easily

The 12th person shakes 11 hands

The 11th person shakes 10 hands, etc.

So...... the sum of

11 + 10 + 9 +......+ 3 + 2 + 1  = 66

 

 Feb 25, 2015
 #3
avatar+118696 
+5
Best Answer

At a party, everyone shook hands with everybody else. There were 66 handshakes. How many people were at the party?

 

Mmm

Let there be k people at the party.

The first person shook with k-1 people.

the second with a further k-2 people

the kth person did not shake with anyone new.

So the number of handshakes was

1+2+3+.....+(k-1)

this is the sum of an AP       S=n/2(a+L) =  k12(1+(k1))=k(k1)2

 

so

k(k1)2=66k(k1)=132k2k132=0

 

k2k132=0{k=12k=11}

 

Obviously there is not a neg number of people so there must be 12 people.

Melody Feb 25, 2015

2 Online Users