Quant Boosters - Hemant Yadav - Set 1


  • Being MBAtious!


    Let mod [X-Y]=[x4x3x2x1 - y4y3y2y1]

    There are total 10 distinct no’s, out of which 2 will not be used. Alice chooses the no’s and Bob places them

    Now, if Alice chooses any no. that is not 0 or 9 on her first call, Bob will manage to keep the difference within 2000. (suppose Alice chooses 3, then bob replace one of the stars in the 4th place with 3 like this ---- - 3---. Now whenever Alice chooses 2 or 4, Bob will replace the corresponding place with it like this 2--- - 3--- or 4--- - 3---.

    So she will choose neither, then she must choose any of 5 or 6 and bob will pick it because he knows Alice will not choose 2 or 4 as long as the star in the corresponding place is not replaced)

    Now, if Alice chooses any of 0 and 9, say 0, and bob places it in the 4th place, she will not choose 1 and 2 and will be able to make the difference cross 2000. so bob will never put 0 in the 4th place. He will place it in x3 in order to make the difference between X and Y minimum. now if the next choice is neither 1 nor 9 and greater than or equal to 5, he will place it in x4 and otherwise in y4 and thus will be able to keep the difference down below 2000. so the next choice must be 1 or 9. Bob will place it in y3 to keep the difference between x3 and y3 minimum, proceeding like this, the largest difference that can be obtained is 6012-3754=2258

    If the first chosen no. is 9, then the largest difference is 3987-6245=-2258
    So their best play would give 2258 as the difference.


  • Being MBAtious!


    Q7) Six persons A,B,C,D,E & F went to cinema. There are six consecutive seats. A sits in one of the seats followed by B, followed by C and so on. If A takes one of the six seats , then B should sit adjacent to A. C should sit adjacent to A or B. D should sit adjacent to A, B,or C and soon. How many possibilities are there?

    [OA : 32]


  • Being MBAtious!


    If f(n) is number of arrangements possible for n persons, then f(n + 1) = 2f(n), as the next person can sit at either end as a continuous chain will form and there is no possibility of a middle chair remaining vacant.
    Also, f(1) = 1, f(2) = 2
    So, f(n) = 2^(n – 1)
    Hence, f(6) = 2^5 = 32


  • Being MBAtious!


    Q8) There are N secret agents each know a different piece of secret information. They can telephone each other and exchange all the information they know. After the telephone call, they both know anything that either of them knew before the call. What are the minimum number of telephone calls needed so that all of the them know everything?

    [OA : 2N - 4]


  • Being MBAtious!


    (2N - 3) telephone calls, for N = 2,3
    (2N - 4) telephone calls, for N > 3

    Divide the N secret agents into two groups. If N is odd, one group will contain one extra agent.

    Consider first group: agent 1 will call up agent 2, agent 2 will call up agent 3 and so on. Similarly in second group, agent 1 will call up agent 2, agent 2 will call up agent 3 and so on. After (N - 2) calls, two agents in each the group will know anything that anyone knew in his group, say they are Y1 & Y2 from group 1 and Z1 & Z2 from group 2.

    Now, Y1 will call up Z1 and Y2 will call up Z2. Hence, in next two calls total of 4 agents will know everything.

    Now (N - 4) telephone calls are reqiured for remaining (N - 4) secret agents.

    Total telephone calls require are
    = (N - 2) + 2 + (N - 4)
    = 2N - 4


  • Being MBAtious!


    Q9) A point P is chosen at random on segment AB of a square ABCD. Point Q is chosen at random on CD. Segment PQ divides ABCD into two regions. What is the probability that one of the two regions is more than twice the area of the other?

    [OA : 4/9]


  • Being MBAtious!


    Plotting it on a graph would be eaisier I guess.

    After joining PQ we will get a trapezium. So to fulfil the required condition sum of the parallel sides of the trapezium should be less than 2a/3 or greater than 4a/3, where a is the side of the square.

    For AP = 0 to a/3, probability of choosing Q will constantly decrease from 2/3 to 1/3
    For AP = a/3 to 2a/3, it will be 1/3
    For AP = 2a/3 to a, it will constantly increase from 1/3 to 2/3

    Now, we can get the area as 4/9

    Another way can be let AB = 1.
    The requirement is the event (AP + DQ) > 4/3 or (AP + DQ) < 2/3. That is the mean of the two sides is either > 2/3 or < 1/3.

    Let X be the random variable for the continuous uniform distribution of AP. The distribution of DQ is independent but also belongs to X.

    Let Y = X + X (the sum of the two opposite sides).

    P(Y > 4/3) is the area of the triangle from Y = 4/3 to Y = 2.
    P(Y > 4/3) = (1/2) * (2/3) * (2/3)
    = 2/9

    Similarly P(Y < 2/3) is the area from Y = 0 to Y = 2/3 and
    P(Y < 2/3) = 2/9

    The events Y > 4/3 and Y < 2/3 are mutually exclusive so the probability of the union is the sum of the probabilities of both events.

    P(Y > 4/3 or Y < 2/3) = 2/9 + 2/9 = 4/9


  • Being MBAtious!


    Q10) Let k ≥ 1 be a positive integer. How many natural numbers 'n' exists with the following property:
    i) n has exactly k digits (in decimal representation)
    ii) all the digits of n are odd.
    iii) n is divisible by 5
    iv) the number m = n/5 has k odd digits.

    [OA : 3^k - 1]


  • Being MBAtious!


    From the 4th point, m = 2n/10

    As 'n' has 'k' digits, 2n will have either 'k' digits or 'k + 1' digits. Now 'm' has got to have 'k' odd digits, hence 2n must have 'k + 1' digits with the last digit obviously 0 (as 'n' is divisible by 5) and all the remaining digits odd. So, 'm' is also a 'k' digit number and combining that with the 4th point we can say that 'm' is a 'k' digit number with all of its digits odd.

    Hence, 'n' must have its digits such that each digit of 'n' when multiplied by 2 gives a carry of 1, if this doesn't hold then we will get an even digit in 'm', which is not acceptable.

    As each digit of 'n' when multiplied by 2, gives a carry forward of 1, each digit of 'n' should be greater than equal of 5 with the last digit always 5 (as 'n' is a multiple of 5)

    For k=1, possible cases =1

    For k=2, last digit can be selected in 1 way and 2nd last digit can be selected in 3 ways ( 5 or 7 or 9)

    For k=3, last digit in 1 way, other 2 digits in 3*3 ways

    Generalizing, 'n' can be formed in 3^(k - 1) ways


  • Being MBAtious!


    Q11) For how many natural numbers 'p', the three numbers (p - 1)/4, (p + 1)/2 and p are always prime?

    [OA : 1]


  • Being MBAtious!


    Say, its 6n + 1, then 2k + 1 = 12n + 3, so a multiple of 3. If its 6n - 1, then 4k + 1 = 24n - 3, so a multiple of 3. Hence, k is either 2 or 3. Only 3 satisfys. So, p = 13 is the only value for which all three numbers are prime.


  • Being MBAtious!


    Q12) "A" and "B" are playing series of repeated games. A player wins if he wins 2 games before other player. Probabilities of "A" winning, drawing and loosing a game are 1/2, 1/3 and 1/6. What is the probability of "A" winning the series.

    [OA : 27/32]


  • Being MBAtious!


    If P(n) denotes the probability of winning of A when no of wins of B is n, then

    P(0) = (1/2)² + 2(1/3)(1/2)² + 3(1/3)²(1/2)² + ....
    = (1/2)²{1 + 2/3 + 3/9 + 4/27 + ....)

    S = 1 + 2/3 + 3/9 + 4/27 + ...
    S/3 = 1/3 + 2/9 + 3/27 + ....
    => 2S/3 = 1 + 1/3 + 1/9 + 1/27 + ....
    => S = 9/4
    P(0) = (1/4)(9/4) = 9/16

    P(1) = (2!/(1!*1!))(1/6)(1/2)² + (3!/1!*1!*1!))(1/3)(1/6)(1/2)² + (4!/(2!*1!*1!)(1/3)²(1/6)(1/2)² + ....
    = (1/6)(1/2)²{2 + 6(1/3) + 12(1/3)² + 20(1/3)³ + 30(1/3)^4 + ... )

    S = 2 + 6(1/3) + 12(1/3)² + 20(1/3)³ + 30(1/3)^4 + ... .....(1)
    => S/3 = 2/3 + 6(1/3)² + 12(1/3)³ + .......... (2)
    (1) - (2) => 2S/3 = 2 + 4/3 + 6/3² + 8/3³ + .... ............(3)
    => 2S/9 = 2/3 + 4/3² + 6/3³ + ..... ...........(4)
    (3) - (4) => 4S/9 = 2 + 2/3 + 2/3² + 2/3³ + .... = 3

    P(1) = (1/6)(1/2)²(27/4)
    = 9/32

    => Probability of A winning = 9/16 + 9/32 = 27/32


  • Being MBAtious!


    Q13) Find the smallest n for which rightmost non-zero digit of P(n) will be odd where P(n) = (n + 5)!/(n – 3)!


  • Being MBAtious!


    p(n) = (n + 5)!/(n - 3)!

    It is clear that p(n) is a product of 8 consecutive numbers and divisible by atleast 8!. That means minimum power of 2 in p(n) is 7, i.e, p(n) is divisible by 2^7.

    But last non-zero digit has to be an odd number, so p(n) should be divisible by 5^7.

    So 15625 (5^6) or its multiple has to be one of the consective numbers, and we have to make sure that there is no multiple of 16 among the 8 numbers.
    Multiple of 16 nearest to 15625 are 15616 and 15632.

    So, least value of n = 15620.

    p(n) = 15618 * 15619 * 15620 * 15621 * 15622 * 15623 * 15624 * 15625
    After removing (2^7)*(5^7), we will get
    7809 * 15619 * 781 * 15621 * 7811 * 15623 * 1953 * 1

    Unit digit = unit digit of 9 * 9 * 1 * 1 * 1 * 3 * 3 * 1 = 9


  • Being MBAtious!


    Q14) How many real number solutions are there for a, b, c and d such that a² + b² + c² + d² = a(b + c + d)

    [OA : Only one solution]


  • Being MBAtious!


    a² + b² + c² + d² = a(b + c + d)
    => a²/4 + (a²/4 + b² - ab) + (a²/4 + c² - ac) + (a²/4 + d² - ad) = 0
    => a²/4 + (a/2 - b)² + (a/2 - c)² + (a/2 - d)² = 0
    => a = b = c = d = 0 is the only solution


  • Being MBAtious!


    Q15) There are 3 ants at 3 corners of a triangle, they randomly start moving towards another corner. What is the probability that they don't collide?

    [OA : 1/4]


  • Being MBAtious!


    Each ants can go towards two direction. so total different possibilities are 2 * 2 * 2 = 8. Out of which 2 are favorable where they all goes clockwise or anticlockwise . Hence required probability = 1/4


  • Being MBAtious!


    Q16) A motor cyclist is travelling on a straight road at 70 kmph towards his house. His pet bird travels at 80 kmph from the motorcylist to the house and back in 1.6 hours. Find the distance between the house and the place from where the bird starts its journey towards the house?

    [OA : 120 km]


 

Looks like your connection to MBAtious was lost, please wait while we try to reconnect.