In the opening ceremony of the 2014 FIFA World Cup Brazil, all football teams who participates gathered together. The team captain of each team was handshaking with one another to promote their new act for world peace which was called "A Handshake for Peace!". Each team captain is as polite as the other. How many teams are there if there were a total of 595 handshakes?
Note: Each team captain had handshake with another team captain only once.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
simple one. I too did the same way!
Nice application of Gauss's Trick. You can also use the traditional formal n ( n + 1 ) / 2 = 5 9 5 , which gives n=34, but then you need to add 1 since the the last coach did not shake hands with anyone (everyone shook his hand), so you get 35.
Log in to reply
well it is the same, just took n − 1 instead of n . It is still the 'traditional' formula.
Let's assume that each team captain is a point. (In this case, let's assume there are 4 teams)
Notice that if we connect those points with one another, then we can create a polygon with a diagonal. the red segments above represents the side of a convex polygon, while green segments represents the diagonals . Furthermore, each segment(both green and red) that was formed by connecting those points represents the handshakes of team captains with one another. Therefore, the total handshakes are the sum of the sides and diagonal of the polygon. This analysis will lead us to a general formula.
let n=number of sides of a polygon " S=total handshakes
S=n + ((n/2)(n-3) therefore; S=(n^2-n)/2
substitute; 595=(n^2-n)/2 n^2-n-1190=0 n=35 and n=-34
since, the number of handshake cannot be negative, and the number of sides of a polygon is always equal to the vertices which represents team captains, so the answer is 35.
Or you can simply use combinations. The number of teams is equal to the number of captains (say n ) and every two of them handshakes only once. So, the number of handshakes can also be interpreted as the number of two distinct element subsets of a set of n (distinct) elements which is simply ( 2 n ) . Since it is given that there are 5 9 5 handshakes, you have,
( 2 n ) = 5 9 5 ⟹ 2 ! n ( n − 1 ) = 5 9 5 ⟹ n 2 − n − 1 1 9 0 = 0
Using quadratic formula, the only positive integral solution to the above quadratic equation is n = 3 5 which is our answer.
Note: There's also a quick alternative. Compute 1 1 9 0 first which is approximately 3 4 . 4 9 6 . Now, try the product of two consecutive integral values around this value and you'll see that 3 5 × 3 4 = 1 1 9 0 giving us n = 3 5 . This actually uses the fact that n ( n − 1 ) ≈ n 2 for large enough n .
Log in to reply
Or. You notice that 1 1 9 0 ends in a 0. Hence the only solutions must be either 35 or 39. 39 is obviously (?) too large , hence answer is 35.
Isn't that Neymar and Pique?
Python 2.7:
1 2 3 4 5 6 |
|
I just added 1-33 and that was too low and added 34 to the past total and it was the answer so 35 since they can only handshake the same team once
The easy way to solve this is (as you have multiple answers). 35 is the only one that can go into 595 as a whole. Unless you want 0.2 of a hand shake. It's not very fulfilling though
Cheater Solution:
Divide 595 by each possible answer.
35 is the only answer where the division is a whole number.
595*2=1190 sqrt(1190)=34.5 or 35
Why? What are you doing here? Random Math?
Intuition, math isn't random
Here's how I did:
Let x be number of captains (=number of teams)
Total handshakes =[( x )( x -1)]/2
595 = [( x )( x -1)]/2
1190 = [( x )( x -1)]
1190 = { x }^{ 2 } - x
{ x }^{ 2 } - x -1190 = 0
Therefore, x = 35 and -34 (discarded)
Therefore there are 35 teams/captains.
use a combination xC2 = 595
The solution will be n*n+1/2=595. n will be 34. Since,captain of n will have n-1 handshakes, no of teams will be 35
Trial and Error works best here. Whichever option that results to a whole number (since we're talking about a real situation here) will be the answer.
I dd it the old Fashioned Long way!Trial and Error,while it may be rudimentary it still worked!35X17=395!
Problem Loading...
Note Loading...
Set Loading...
There are n captains. Take one, he shakes n − 1 hands. Then take a second one, he has n − 2 hands to shake because he already shook hands with the first one. etc... Therefore there will be ∑ k = 1 n − 1 k = 2 n ( n − 1 ) handshakes, resulting in n = 3 5 .