# TIFR2013-A-3

1.2k views

Three candidates, Amar, Birendra and Chanchal stand for the local election. Opinion polls are conducted and show that fraction $a$ of the voters prefer Amar to Birendra, fraction $b$ prefer Birendra to Chanchal and fraction $c$ prefer Chanchal to Amar. Which of the following is impossible?

1. $(a, b, c) = (0.51, 0.51, 0.51);$
2. $(a, b, c) =(0.61, 0.71, 0.67);$
3. $(a, b, c) = (0.68, 0.68, 0.68);$
4. $(a, b, c) = (0.49, 0.49, 0.49);$
5. None of the above.

edited

$6$ preference order for voter are possibe:

$ABC.ACB,BCA,BAC,CAB,CBA$ also Given that

$a=ABC+ACB+CAB(A$ prefer over $B) ---(1)$

$b=BCA+BAC+ABC(B$ prefer over $C) ---(2)$

$c=CAB+CBA+BCA(C$ prefer over $A) ---(3)$

Adding $1,2$ and $3$ we get

$a+b+c=2(ABC+BCA+CAB)+ACB+BAC+CBA$

Now we know that $ABC+ACB+BAC+BCA+CAB+CBA=1$ therefore

$[ABC+ACB+BAC+BCA+CAB+CBA]<[2(ABC+BCA+CAB)+ACB+BAC+CBA]<2(ABC+ACB+BAC+BCA+CAB+CBA)$

Hence we can say that value of $a+b+c$ must be between $1$ and $2$

option (c) value greater than $2$ hence correct answer is (c)

edited
0
Not getting how did you got 2 as an upper bound?
0

please explain the upper bound thing ?

3
We know that (ABC+ACB+BAC+BCA+CAB+CBA)=1 therefore 2 *(ABC+ACB+BAC+BCA+CAB+CBA) = 2.

[ABC+ACB+BAC+BCA+CAB+CBA] < [2(ABC+BCA+CAB)+ACB+BAC+CAB]

< 2(ABC+ACB+BAC+BCA+CAB+CBA)

This can be written as, 1 < (a+b+c) < 2.

It means (a+b+c) must be lies bw 1 and 2, all options follow except option (c).

So,(C) is ans.
0

Best explanation for such new question.Thanks, saurav04.

0
..
0

a+b+c=2(ABC+BCA+CAB)+ACB+BAC+CAB

it should be CBA (last one)
0
0

@Shaik Masthan

Can a + b + c = 2 ?

or is (a + b + c) strictly less than 2?

0
on what basis is the equation written . I could not understand . can any one explain it
2

@Ruchi Vora

fraction a of the voters prefer Amar to Birendra

It means all the cases where Amar should come before Birendra  i.e. ABC or CAB or ACB (position of C doesn't matter)

so thats why a = ABC+CAB+ACB

I will just answer for option (C)  , rest 3 would be then easy to derive.

LET THERE BE ONLY 100 PEOPLE .
(TRY TO DRAW A Venn diagram FOR MY EXPLANATION, IT WOULD BE SIMPLE TO UNDERSTAND)

Amar=  Modi , Birendra = Kejriwal , C= Rahul

GIVEN THAT :
Any 68 people say (Modi > Kejriwal) (means Modi is greater than Kejriwal)
Any 68 people say (Kejriwal > Rahul)

But we have only 100 people. So there is definitely some intersection.
So at least (68+68-100)=36 people made both the statements (i.e Modi > Kejriwal and Kejriwal > Rahul means these 36 people actually mean Modi > Kejriwal).

So these 36 people can NEVER Contradict themselves and make the 3rd statement : "Rahul > Modi" .

So only at most remaining 100-36 = 64 people can make the 3rd statement but option (C) says 68 people made this statement which is NEVER possible as discussed above.
0
yaha bhi bhakti !! π

## Related questions

1
422 views
Let there be a pack of $100$ cards numbered $1$ to $100$. The $i^{th}$ card states: "There are at most $i - 1$ true cards in this pack". Then how many cards of the pack contain TRUE statements? $0$ $1$ $100$ $50$ None of the above.
Three men and three rakhsasas arrive together at a ferry crossing to find a boat with an oar, but no boatman. The boat can carry one or at the most two persons, for example, one man and one rakhsasas, and each man or rakhsasas can row. But if at any time, on any bank, ( ... other side without any mishap, what is the minimum number of times that the boat must cross the river? $7$ $9$ $11$ $13$ $15$
Consider the following two types of elections to determine which of two parties $A$ and $B$ forms the next government in the 2014 Indian elections. Assume for simplicity an Indian population of size $545545 (=545 * 1001)$. There are only two parties $A$ and $B$ and every ... forms govt. by election TYPE P, then it will also form the govt. by election TYPE C. All of the above None of the above.
Consider a function $T_{k, n}: \left\{0, 1\right\}^{n}\rightarrow \left\{0, 1\right\}$ which returns $1$ if at least $k$ of its $n$ inputs are $1$. Formally, $T_{k, n}(x)=1$ if $\sum ^{n}_{1} x_{i}\geq k$. Let $y \in \left\{0, 1\right\}^{n}$ be such that $y$ has ... $y_{i}$ is omitted) is equivalent to $T_{k-1}, n(y)$ $T_{k, n}(y)$ $y_{i}$ $\neg y_{i}$ None of the above.