You are on page 1of 6

Q. In how many ways can 2700 be written as a product of 8 distinct integers?

a6
b0
c4
d More than 6

Ans - The only way in which 2700 can be written as product of 8 integers is by using negative integers. So,
2700 = 1 * 2* 2 * 3 * 3* 3 * 5 * 5 -> 8 integers, we need to put in negative signs in a way that all are distinct.

So consider (2*-2) * (3*-3) * (5*-5) * (-1 * 3)

Now 3 is getting repeated,


so we need to multiply it with one of the others instead of -1, and multiply -1 instead with 1

So in all 3 can go with 6 other integers, so in all 6 ways,

Q. X is the largest sum of rupees which can never be paid using any number of coins of denominations Rs.4, Rs.8,
Rs.13 and Rs.18. What is the sum of the digits of X ?

a9
b 10
c 11
d None of these

Ans - The given numbers are of the form ... X, 2X, 3X+1, 4X+2 (i.e.X=4)

Largest number which cannot be obtained using the combination is of the form 6X+3. After that all of them can be
written using the above combinations.

So the answer is 6X+3 = 6(4)+3 = 27 = 2+7=9

Q. A=10 * w^9 * x^7 * y^3 and B= 50 * w* x^13 * z^4, where w,x,y,z are distinct prime numbers greater than
10. If A*B=C , find the number of those common multiples of A & B that are factors of C.

(a) 80
(b) 64
(c) 48
(d) 16

Ans - the lcm of A nd B will be 50*w^9*x^13*y^3*z^4..which is the least common multiple of A nd B...now
A*B=500*w^10*x^20*y^3*z^4....the possible factors(A nd B) can be arrangement of individual parts for example..
the factors of A*B will simply be multiples of Lcm of A nd B
factors of 500 greater than or equal to 50 are which are also multiple of 50 (50,100,250,500)......4 optns similarly for
powers of w ..we will have only two options w^9 and w^10..similarly for powers of y can range from 13 to 20 ..ie 8
options..and for y and z we have only one option ...so possible combinations will be
4*2*8*1*1=64 Ans

Q. There are 16 stations between London and Edinburgh. Find the number of ways in which a train can stop at any
5 of these intermediate stations such that no two such intermediate stations are next to each other?
(a) 330
(b) 1365
(c) 792
(d) 495

Ans - The question is same as putting 5 stations between 11, such that no 2 stations are next to each other.

There are 12 gaps between and aside 11 stations. We can choose any 5 of these 12.

Thats C(12,5)=792

Given N = 35 36 37 . 67, what is the remainder left when N is divided by 289?


a) 3
b) 238
c) 51
d) 286
Ans - 289 = 17*17
N = 35 36 37 . 67
divide N by 17*17, cancel 17 from both numerator (51 = 17*3) and denominator
Rem (35 36 37 x 50 x 3 x 52. 67) / 17
Rem(1*2*3...*16 * 3 * 1*2*3...16) / 17
Rem(16! * 3 * 16!)/17
Rem(16! / 17) = 1 (Wilson's theorem)
therefore, Rem(16! * 3 * 16!)/17 = 1 * 3 *1 = 3
now multiply 17 that we cancelled earlier, so Rem = 3*17 = 51

Q - If x + y + z = 3, where x, y and z are positive real numbers, then the integer which is nearest to the maximum
value of x^2y^3z is
a) 1
b) 2
c) 0
d) 3

Ans - x^2y^3z will have maximum value when x/2=y/3=z. so let x/2=y/3=z=k then
x+y+z=3
2k+3k+k=3
6k=3 =>k=1/2
so x^2y^3z = 1^2 *(3/2)^3 *1/2 =27/16 =1.68 closest to 2.

Q - How many pairs of numbers exist such that their LCM is 1260 and their HCF is a prime number?

Ans - let's denote the pair of numbers as (X, Y)


let's assume X = ka and Y = kb such that k is a prime number and HCF(a,b) = 1
now k*a*b = 2^2 * 3^2 * 5 * 7
k can take four values i.e. 2,3,5 and 7

case1: when k=2


a*b = 2* 3^2 * 5 * 7, no of pairs = (2*3*2*2) / 2 = 12
(There will be cases like (6,105) can be present). Actual pairs will be
(2*2*2)/2 * 2
This is because 3^2 should go to either a or b but not be shared so lets keep it aside.
Remaining will be
(2*5*7) = no of pairs (2*2*2)/2 = 4
But for each of these pairs(a,b) one element can be multiplied with 9(3^2)
So new total pairs will be 4*2 = 8

case2: when k=3


Same as above pairs = 8

case3: when k=5


Here 2^2 and 3^2 should go to one element of pair the only possibilities are
(4*9*7,1)(4*9,7) (4,9*7), (4*7,9) = 4

case4: when k=7


same as case 3 so pairs = 4

Total pairs = 24.


Q -Anju and Bobby simultaneously started climbing up an ascending escalator (a moving staircase). Since they were
in a hurry, they also started climbing up the steps (taking one step at a time). Anju took k steps in the time that
Bobby took 1 step, where k is an integer greater than 1. How many values can k take, if it is known that the speed of
the escalator was the same as that of Bobby and Anju took a total of 72 steps to climb up the escalator? (Assume
that the number of steps taken by Bobby was also an integer)
a) 5
b) 8
c) 9
d) 11
Let the speed of elevator and bobby be x then the speed of Anju will be kx.
Now no of steps taken by bobby =72/k so k can take 12 steps.(72=2^3*3^2)but k cant be 1 so k can take 11
values.
Total number of steps=72+72/k
Time taken by Anju to climb =(72+72/k)/(k+1)x
Since the relative speeds of Anju and Bobby are in the ratio of (k+1)x:2x. So the time taken by Bobby to climb=
(k+1)/2 * time taken by Anju
= (72+ 72/k)/2x
So steps taken by Bobby = (72+72/k)/2x *x = 36+36/k
So now k can take (9-1=8) values as k cannot be 1.

Q . Find the remainder of 59^73^5!/37.


59 and 37 are coprimes so 59^36K divided by 37 leave remainder 1
73 = 36k+1
so 73^5! = 36k+1
so the values becomes 59^(36k+1)
=59/37
Remainder = 22

1. There are 6 balls of different colours and 3 boxes of different sizes. Each box
can hold all the 6 balls. The balls are put in the boxes so that no box remains
empty. The number of ways in which this can be done is:

(a) 534 (b) 543 (c) 540 (d) 528

2. On a railway there are 10 stations. The number of types of tickets required so


that it may be possible to book a passenger from every station to every other is?
a.10! / 2! b. 10! * 2! c. 10!/8! d. 10!/8! 2!

3. The number of ways in which the letters of the word "ARGUMENT" can be
arranged so that only consonants occur at both the ends is:

(a) 3!*5! (b) 14400 (c) 41000 (d) none of these

4. The number of ways in which the digits of the number 125453752 can be
arranged such that no two 5s come together is:

(a) 9! * 3! * 2! (b) 7! * 3! * 2! (c) 6! * 2! (d) None of


these

5. If 2^(x -1) + 2^(x+1) = 320, then the value of x is

(a) 4 (b) 5 (c) 6 (d) 7

6. After a typist had written ten letters and had addressed the ten corresponding
envelops, a careless mailing clerk inserted the letters in the envelopes at random,
one letter per envelop. What is the probability that exactly nine letters were
inserted in proper envelop?

(a) (b) 1 (c) 0 (d) 9/10

7. In a 26-question test, five points were deducted for each wrong answer and
eight points were credited for each correct answer. If all the questions were
answered, how many were correct if the score was zero?

(a) 13 (b) 6 (c) 9 (d) 10

8. There are n players in an elimination type singles tournament. How many


matches must be played (or defaulted to determine the winner)?

(a) n + 1 (b) n -1 (c) n - 2 (d) n + 2

9. If the value of x is greater than or equal to -1 and less than or equal to 2 and the
value of y is greater than or equal to 1 and less than or equal to 3, then least
possible value of (2y - 3x) is

(a) 0 (b) -3 (c) -4 (d) -5

10. When n is divided by 4, the remainder is 3. What is the remainder when 2n is


divided by 4?

(a) 1 (b) 2 (c) 3 (d) 6


To get fresh updates about MBA exams on your Facebook & Twitter timelines,
subscribe to our pages created specifically for them. We will post only exam
specific links on these pages:

Facebook: https://www.facebook.com/PaGaLGuy

Twitter: https://twitter.com/pagalguy

Answers

1(c) 2(c) 3(b) 4(d) 5(d) 6(c) 7(d) 8(b) 9(c) 10(b)

You might also like