Posts

Showing posts with the label party

Spot The Liar Among

There is a party of 100 politicians. All of them are either honest or liars. You walk in knowing two things:

1. At least one of them is honest.


2. If you take any two politicians, at least one of them is a liar.


From this information, can you know how many are liars and how many are honest?


Spot The Liar Among


Know the total number of liars here! 

Knowing The Number of Liars


What is the question?

The information that we have - 

1. At least one of them is honest.

2. If you take any two politicians, at least one of them is a liar. 


Only one of them must be honest and other 99 must be liars. 

Those are the only numbers that can justify the second piece of information. In the case, if any 2 are selected at least 1 of them liar while other may or may not liar (i.e. may be honest). 


Knowing Number of Liars

Count The Number of People From Handshakes

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


Count The Number of Handshakes


Skip to the count!

Getting Count of Number of Peoples From Handshakes


Want to read question first? Click here!

Let's suppose that there are 'n' number of people in the party.

The first person will shake hand with (n-1) people, the second person will shake hand with (n-2) people, the third will shake hand with (n-3) people.

In this way, (n-1) th person will shake hand with n-(n-1) = 1 person i.e. last person.

Adding all the number of handshakes,

(n-1) + (n-2) + (n-3) + ..... + 3 + 2 + 1 = n[(n-1)/2]

But total handshakes given are - 66

n[(n-1)/2] = 66

n(n-1) = 132

n^2 - n - 132 = 0

(n-12)(n+11) = 0

n = 12 or n = -11

Since number of people can't be negative, n = 12.

Getting Count of Number of Peoples From Handshakes


Hence there are 12 people in the party.

Follow me on Blogarama