# Free Quant Practice Test - CAT

Anil has bought a new game, which is in the form of 6 concentric circles.The 6th circle has a radius of 6 and it has 6 openings. A ball is positioned on the circumference of the innermost circle and it finally exits from the circumference of the outermost circle. Thus, the ball starts travelling from the smallest circle 1 and leaves it at the point of opening on the normal to reach the next circle 2, then it moves in a similar manner to 3 and so on.The total number of different paths in which the ball can take to come out of the 6th circle is?

A.

26*6!

B.

25*6!

C.

6!

D.

25(5)!

#### SOLUTION

Solution : A There are n openings to come out of the nth circle and it can travel in

the clockwise or anticlockwise direction to enter the (n+1)th circle.

Thus the number of paths is

(1*2)*(2*2)*(3*2)......(6*2) = 6!*26

Shortcut

This is a numbers to numbers question.

Use the technique of double substitution

Rewrite the answer options in terms of n as follows,

a) 2nn!               B) 2n1*n!            c) n!       d) 2n1(n -1)!      e) 2n+1(n-1)!

Now at n=1, there are 2 ways in which they can exit from the innermost

circle. At n=1 only option (a) gives 2. Answer is option (a)

If a,b,c are in Geometric Progression, then the equation ax22bx+c=0 and dx22ex+f=0 have a common root if da,eb,fc are in?

A.

Arithmetic Progession

B.

Geometric Progression

C.

Harmonic Progression

D.

GP or HP

#### SOLUTION

Solution : A

Solve it using Assumption

Put a=1,b=1,c=1.

Equation (1) is x22x+1=0. Sum of the roots= 2 and product of roots= 1

Thus the roots are 1,1

Let the common root be 1

Let us assume the other root =2

The equation changes to

x2+3x+2=0

Thus, 2ed=3 and fd=2

When d=1, f=2 and  e=32

Thus da; eb; fc = 1, 1.5, 2 are in AP. Answer is option (a)

Let g(x)= |x+1|. The number of values  that 'x' can take (given that its range is between -2 & + 2 (both inclusive) for which g(x-3), g(x-1), g(x+1) are in AP is?

A.

1

B.

2

C.

0

D.

4

#### SOLUTION

Solution : B

g(x-3) = |x-2|

g(x-1)=|x|

g(x+1)= |x+2|

These will be in AP if

2|x| = |x-2|+|x+2|

Only x= -2 and x=2 satisfy the above equation in the given range.

There are 3 types of Coffee powder available at La Cafe. They are graded based on the chicory content. The three grades of coffee contain 1% chicory, 2% chicory and 3% chicory in the coffee blend. If p kgs of the 1%  grade and q kgs of the 2% grade and r kgs of the 3% grade are mixed to give p+q+r kgs of 1.5% grade, what is p in terms of q and r?

A.

q+3r

B.

q+r4

C.

2q + 3r

D.

4.5q+3r

E.

3q+ r

#### SOLUTION

Solution : A

Put r=0, then if 1 kg of 1% grade is mixed with 1 kg of 2% grade, we get

2 kg of  1.5%  Grade. Hence p=1, q=1 and r=0. Substitute in answer

Options to get answer as option (a)

There are 300 people in a locality. Every person in the locality reads 5 different magazines and every magazine is read by 60 people. How many different magazines are there?

A.

atleast 30

B.

exactly 25

C.

atleast 35

D.

between 30 & 35

#### SOLUTION

Solution : B

Let the number of magazines = n

The total number of times the magazines are read = 300*5 = 1500 = 60*n

Hence n=25.

Which of the following values of x would give a number such that (1073)71-x is divisible by 100?

A.

61

B.

77

C.

71

D.

69

#### SOLUTION

Solution : B

Conventional Approach

Using the technique of last two digits:

The question is to find the last two digits of (1073)71 (which is nothing but the remainder when the number is divided by 100).

We will solve this using a technique as explained below and also in our demo tutorial in arithmetic.

(1073)71=(..73)71=(..73)68×(..73)3
=(..732×..732)17×(..73)3
=(..29×..29)17×(..73)3
=(..41)17×(..73)3
=81×29×73=...77

Shortcut of a shortcut!

Using answer options:

From the power cycle of 3 (3,9,7,1) -

71= 4k+3

Thus, the last digit should be 7. The only answer option ending with 7 is option (b).

Let y=12+13+12+13+..... What is the value of y?

A.

13+32

B.

1332

C.

15+32

D.

1532

#### SOLUTION

Solution : D

Given : y=12+13+12+13+........

Thus y=12+13+y

y=3+y6+2y+1;2y2+7y=3+y; On solving, y=3±152; since the given fraction is positive, the value of y is 1532

You can also go from elimination of answer options. Answer should

< 0.5 and close to it. This happens only at option (d)

In the given figure, MN is the common tangent to both the inner circles with M and N lying on the circumference of the biggest circle. MN=16. The centers of the smaller circles lie on the diameter of the biggest circle. Find the area of the shaded region A.

16π

B.

18π

C.

20π

D.

32π

#### SOLUTION

Solution : D

e. 32π

If the radii of the three circles be a, b and c decreasing order of size,then

2b+2c=2a; a= b+c.

ΔAMC and ΔANC are congruent. ΔABM and ΔABN are similar; so ΔBMC and ΔBNC are congruent. Thus MB=BN=8.

Thus, AB.BC = MB.BN=64.

AB.BC= 2c.2b=64. (since triangle AMB=triangle MCB)

The required area is π ( (b+c)2 - b2 - c2); = 2π bc = 2π.16=32π. Find the remainder when 755 is divided by 29.

A.

4

B.

25

C.

1

D.

0

#### SOLUTION

Solution : B

We need to use reverse of Euler's theorem as the Euler's number for 29=28.

And the question reduces to (72729) (Rem).

The right answer multiplied by 7, should give a remainder of 1 when divided by 29, as (72829) (Rem) = 1.

Thus, the answer is option (b).

Verification -

25 or (4)×7= -28 remainder of 1.

If 2g(x)+3g(1x)=x1, then find the value of g(2).

A.

710

B.

1210

C.

711

D.

12

#### SOLUTION

Solution : A

Shortcut: Direct substitution

First put x=2

2g(2)+3g(12)=21=1

Put,x=12

2g(12)+3g(2)=121=12

Solving (1) and (2), g(2)=710

An eight digit number divisible by 9 is to be formed by using 8 digits out of the digits 0,1,2,3,4,5,6,7,8,9 without replacement.
The number of ways in which can be done is

A.

2(7!)

B.

4(7!)

C.

(36)(7!)

D.

(7!)(33)

#### SOLUTION

Solution : C

From the digits 0 1 2 3 4 5 6 7 8 9

The sum is 45

Thus, every time we remove 2 digits which add up to 9, we will have a new set of 8 numbers which are divisible by 9

Case 1

Removing 0 and 9

Number of cases possible = 8!

Case 2

Removing

(1)8 and 1

(2)7 and 2

(3)6 and 3

(4)5 and 4

In each case, total number of cases = 8!-7!

(we subtract 7! Because those are the cases where 0 is the first digit)

Hence, total number of ways = 4(8!-7!)+8!= 36x7!.

Four concentric circles share the same centre. The smallest circle has a radius of 1 inch. For n ≥ 1, the area of the nth smallest circle in square inches, An, is given by An+1=An+(2n+1)π. What is the ratio of the sum of the areas of the four circles to the sum of their circumferences?

A.

1

B.

32

C.

2

D.

3

#### SOLUTION

Solution : B

Following the pattern

A1=π
A2=4π
A3=9π
A4=16π
Hence r = 1,2,3 4
Thus
C1= 2π
C2= 4π
C3= 6π
C4= 8π
Ratio = 1.5

Given that a> 0 and i belongs to a set of natural numbers. If a1,a2,a3.....a2n are in AP, then find the value of a1+a2na1+a2+a2+a2n1a2+a3............+an+an+1an+an+1

A.

n-1

B.

na1+a2na1+an+1

C.

n1a1+an+1

D.

n+1a1+an+1

#### SOLUTION

Solution : B

Let the AP be 1,2,3,4,5

At n=1, the AP = 1,2

a1=1 and  a2=2

The value of the expression =32.4

Only option (b) gives this value

Find the number of values of x for which 8x+27x12x+18x=76

A.

1

B.

2

C.

3

D.

>3

#### SOLUTION

Solution : B

Let 2x=a and  3x=b, the equation becomes

a3+b3a2b+b2a=76

or a2ab+b2ab=76

or 6a213ab+6b2=0

(2a3b)(3a2b)=0

Therefore 2x+1=3x+1 or 2x1=3x1 which implies that x= -1 and x= 1. Hence only two solutions exist.

Two guys Abhinav and Bineesh are walking downward and upward respectively on a descending escalator. Abhinav takes three steps in the same time when Bineesh takes two steps. When Abhinav covers 90 steps he gets out of the escalator while Bineesh takes 80 steps to get out of the escalator. If they start from opposite ends using the same escalator find the difference in steps covered by them when they meet.

A.

48

B.

20

C.

30

D.

24

E.

15

#### SOLUTION

Solution : D

Let the escalator move x steps when A walks down 90 steps. Total number of steps on a stationary escalator = x + 90.

When A takes 90 steps, B should have taken 60 steps and the escalator x steps. So when B takes 80 steps, the escalator should have taken  43×x steps.

So, 43×x+80=x+90

Total number of steps in the escalator when it is stationary. So x = 30. Hence, total number of steps = 120.

By the time they meet, together they will 120 steps in the ratio 3:2. i.e 72 and 48 steps. So difference is 24. Option (d).

If N=702730+302780 is divisible by 10x (x is a natural number), find the rightmost non-zero integer in the remainder when N is divided by 10x+1 (if x is maximum).

A. 7

B. 1

C. 9

D. 0

#### SOLUTION

Solution : C

The question is based on the last non-zero digit (i.e. remainder when the number is divided by 10), as when x is maximum, 10x will cancel out all the zeroes in the end.

It now becomes a question based on the rightmost non-zero integer in 72730 (302780 will end with more zeroes).

727302730=4K+2

Thus, the rightmost non-zero integer is 9.

When Arpita was going through her address book, she glanced upon the telephone number of her old friend, Gita. However, the last two digits were erased. But being a math freak, Arpita remembered that Gita had a 6 digit telephone number starting with 2345_ _ whose digital sum =7 (digital sum is the sum of the digits of a number till a single digit number is obtained). Find the maximum number of trials till she dials the right number.

A.

10

B.

9

C.

20

D.

11

#### SOLUTION

Solution : D

As of now the sum is 14. Let the last two digits be a and b.

With an upper limit of 9 for a and b:
a+b = 2 and a+b = 11

Number of solutions for a+b = 2 is 3 [(0,2), (2, 0), (1, 1)].

Number of solutions for a+b = 11 is 8 (12C14=8)

Total number of ways = 11

Shortcut:

The question is about an AP with common difference = 9 in a span of 100 numbers. Answer is 1009=11.

A 50m long platoon is marching ahead. The last person in the platoon wants to give a letter to the first person leading the platoon. So while the platoon is marching he runs ahead, reaches the first person and hands over the letter to him and without stopping he runs and comes back to his original position. In the mean time the whole platoon has moved ahead by 50m. How much distance (approximately) did the last person cover in that time. Assuming that he ran the whole distance with uniform speed

A.

120m

B.

100m

C.

102m

D.

97m

E.

111m

#### SOLUTION

Solution : A

The last person covered 120.71 meters.

It is given that the platoon and the last person moved with uniform speed. Also, they both moved for the identical amount of time. Hence, the ratio of the distance they covered - while person moving forward and backward - are equal. Let's assume that when the last person reached the first person, the platoon moved X meters forward.

Thus, while moving forward the last person moved (50+X) meters whereas the platoon moved X meters.

Similarly, while moving back the last person moved [50-(50-X)] = X meters whereas the platoon moved (50-X) meters.

Now, as the ratios are equal,

[50+X]X=X[50X]
[50+X]×[50X]=X×X

Solving, X=35.355 meters

Thus, total distance covered by the last person
=[50+X]+X
=2×X+50
=2×[35.355]+50
=120.71 metres.
=120 m (Approximately)

A number is said to be a 'zeroth number' if the sum of the squares of its digits ends in a zero. How many two-digit 'zeroth numbers' are there?

A.

14

B.

12

C.

13

D.

17

#### SOLUTION

Solution : D

Let the number be 10x + y.

Then, 1x9, 0,y9 and x2+y2=10k.

xx2y2 must end inPossible value of y1193,72464,63911,941642,85255563642,874911,986464,698193,7

The required number = 17, hence option (d).

Let x and y be consecutive integers. Suppose m be the number of solutions of x3y3=3k2 and n be the number of solutions of  x3y3=2t2 , where k, t are integers. Then m + n equals:

A.

13

B.

5

C.

6

D. None of these

#### SOLUTION

Solution : D

Let  x=y+1 so, x3y3=1+3y(y+1) clearly this is not divisible by either 2 or 3 so m = 0 and n = 0 so m+n=0.
Hence option (d)

In the given equilateral triangle, the smaller circle and the bigger semi circle are inscribed inside. What is the value of  XY A.

3

B.

2

C.

4

D.

4.5

#### SOLUTION

Solution : A

Line PV bisects line QR. ΔPST and  ΔTUV are similar.

Hence ZY+X=YX=Y;YZ=XYX+Y;

but in ΔPST, YZ = sin 30 = 12 Hence (12) = XYX+Y;XY=3

An engine without wagon can go at the rate of 24 kmph and  its speed diminishes  by a quantity which varies as the square root of the
number of wagons attached. With four wagons its speed 20 kmph. The greatest number of wagons with which the wagon can move is :

A.

143

B.

144

C.

145

D.

122

E.

123

#### SOLUTION

Solution : A

Decrease in speed = 24 - 20 = 4

4=k4k=2

Now, for the speed to decrease to zero

24=kx, where x is the number of wagons which

will stop the engine

X= 144

The greatest number of wagons with which the wagon can move is 143

Find the minimum value of a+b+c+d in the equation x5ax4+bx3cx2+dx243=0, if it is given that the roots are positive real numbers ?

A.

780

B.

660

C.

30

D.

720

#### SOLUTION

Solution : A

There are 5 roots in this equation.

Here the product of the roots is given as 243. Hence the sum will be minimum when the roots are equal. In fact a,b,c and d will be minimum when the roots are equal.

243 = 35

Hence, the roots will be 3,3,3,3 and 3

a= sum of the roots = 15

b=Sum of product of roots taken 2 at a time = (3 × 3)+(3 × 3)...10 times or =  5C2×9   = 90

c= Sum of product of roots taken 3 at a time = (3 × 3× 3)+(3× 3× 3)...5 times or =  5C3×27   = 270

d=Sum of product of roots taken 4 at a time = (3× 3× 3× 3)....5 times= 405

Hence, a+b+c+d = 780

In a class, there are 100 students. They are asked to vote for the teachers they like among five teachers namely Vanita Sehgal, Rashmi Ojha, Dharmendra Kumar, Satish M and L Maraditya. Any student can vote for any number of teachers but they have to vote for at least one. Below is the number of votes achieved by the five teachers. Vanita Sehgal: 47, Rashmi Ojha: 15, Dharmendra Kumar: 41, Satish M: 28, L Maraditya: 25 Determine the least number of students who have voted for a minimum of two of the five teachers.

A.

13

B.

14

C.

15

D.

11

#### SOLUTION

Solution : B

X= I + II + III + IV + V = 100

S= I + 2II + 3III + 4IV +5V = 47 + 15 + 41 + 28 + 25 = 156 (each circle added)

S-X= 56= II +2III+3IV+4V

To minimize (II+III+IV+V), we have to maximize 1

To do this make II, III and IV=0

Thus, 4V= 56 V= 14

Thus minimum of (II+III+IV+V)= 14

Suppose f(x)=(x+1)2 for x1.  If g(x) is the function whose graph is reflection of the graph of f(x) with respect to the line y = x, then g(x) equals:

A.

x1

B.

x+1

C.

x1

D.

x

#### SOLUTION

Solution : C

Reflection of a function about the line y=x is nothing but finding the inverse of the function. So the question basically is to find the inverse of f(x)

y=(x+1)2
y1=x
Replace y with x gives inverse function of f(x)
f1(x)=x1

If  f(x)=xx+1, determine the value of g(2)  if, g(x)=f[1x+1]1f(x+1).

A.

112

B.

1312

C.

1312

D.

112

#### SOLUTION

Solution : C

Method :1 Conventional Approach

f[1x+1]=[1x+1][{1x+1}+1]=1x+2

1f(x+1)=1[x+1x+2]=x+2x+1

g(x)=f[1x+1]1f(x+1)=[1x+2][x+2x+1]

g(2)=(14)(43)=1312

Hence option (c)

SHORTCUT : Direct Substitution

When x=2
G(2)=f(13)1f(3)=(14)43=1312.

Find the remainder when 4001000 is divided by 17?

A.

0

B.

1

C.

-1

D.

2

#### SOLUTION

Solution : B

This needs the application of basic remainder theorem, fermat theorem and frequency method

First find the remainder when 400 is divided by 17= 9

The problem changes to 9100017

From fermat theorem the Euler's number of 17 is 16.(for all prime numbers, euler's number=N-1)

1000 = 16k +8

Problem now changes to 9817

Going by frequency method . 9417 gives remainder -1 so 9817 will give remainder 1.

If 16th of a number is subtracted from 290, the result is equal to 50% of the number. Find the number.___

#### SOLUTION

Solution :

Let the number be x.

According to the statement,

290x6=x2

or x2+x6=290

or 4x6=290

or x = 435.

Therefore, the number is 435.

The greatest perfect square less than 20000 which is divisible by each of 2,5,7 and 8 is :___

#### SOLUTION

Solution :

The least number that is exactly divisible by 2, 5, 7 and 8 is its LCM which is 280.

Since 280 is not a perfect square, the multiples of 280 are checked for perfect square.

Now, 280=23×51×71. So, 280 must be multiplied with a minimum of 21×51×71 i.e. 70 to make it a perfect square.
So, the required number is: 280×70=19600 which is the greatest perfect square less than 20000 satisfying this condition.

How many positive integers 1260 are relatively prime to 1260?

A.

723

B.

360

C.

900

D.

288

#### SOLUTION

Solution : D

Method 1: Conventional Approach

1260=22×32×5×7

We need to find the number of positive integers 1260 which are not divisible by 2, 3, 5 or 7.

Let A be the set consisting of multiples of 21260;
B be the set consisting of multiples of 3;
C be the set consisting of multiples of 5 & D of multiples of 7.

A=12602=630,
B=12603=420,
C=12605=252,
D=12607=180
A Π B=12602×3=210 A Π C=12602×5=126  A Π D=12602×7=90

B Π C=12603×5=84
B Π D=12603×7=60  C Π D=12605×7=36
A Π B Π C=12602×3×5=42
A Π B Π D=12602×3×7=30
A Π C Π D=12602×5×7=18
B Π C Π D=12603×5×7=12
A Π B Π C Π D=12602×3×5×7=6

So, ABCD=630+420+252+18021012690846036+42+30+18+126=972

So, 1260 - 972 = 288 integers are relatively prime to 1260.

Method 2: Shortcut: Using the concept of Euler's number

The number of positive integers 1260 which are relatively prime to 1260 can be directly found by finding the Euler's number of 1260
=N(112)×(113)×(115)×(117)
=1260×12×23×45×67=288

(where 2,3,5,7 are the prime factors of 1260)

How many positive integers x10000 are there such that the difference 2xx2 is not divisible by 7?

A.

6662

B.

7142

C.

3687

D.

7562

#### SOLUTION

Solution : B

2xx2 is divisible by 7 if and only if 2x and x2 both leave the same remainder when divided by 7.

x2xRemainder with 7 1222443814162532466417128282564

xx2Remainder with 7 111244392416252546361749086419814101002

Remainder of 2x repeats after every 3 and remainder of x2 repeats after 7. The remainders of both 2x and x2 will repeat after a period of length 3×7 = 21

x1234567891011121314151617181920212x241241241241241241241x2142241014224101422410

In this set of 21 values, we see that there are 6 values of x for which the remainders are same.

As per the periodicity, within every consecutive 21 values, 6 will repeat.

10,000 = 21×476 + 4

The 476 groups contribute 476×6 = 2856 values and the remaining 4 will give 2 values.
So, total 2858 integers 10000 are divisible. Thus, 10000- 2858 = 7142 integers are not divisible.

The integers from 1 to 1000 are written in order around a circle. Starting at 1, every fifteenth number is marked (that is 1, 16, 31, etc.). This process is continued until a number is reached which has already been marked. How many unmarked numbers remain?

A.

732

B.

136

C.

635

D.

800

#### SOLUTION

Solution : D

Consider the first round: - All the numbers which leave a remainder of 1 when divided by 15 will be marked. (1, 16, 31, 46 ... 991)

Consider the second round: - The first number to be marked is 991 + 15 - 1000 = 6. Thereafter all the numbers which leave a remainder 6 when divided by 15 will be marked. (6, 21, 36, 51 ... 996)

Consider the third round: - The first number to be marked is 996 + 15 - 1000 = 11. And all the numbers which leave a remainder 11 when divided by 15 will be marked. (11, 26, 41, 56 ... 986)

The first number to be marked in the fourth round is 986 + 15 - 1000 = 1. Now the cycle will repeat.

If we see the numbers which are getting marked are: 1, 6, 11, 16, 21, 26, 31, 36 ... 996

i.e. all the numbers which divided by 5 leave a remainder 1. So there are 10005=200 numbers. So, 1000 - 200 = 800 numbers remain unmarked.

In a 4 person race, medals are awarded to the fastest 3 sprinters. The first-place sprinter receives a gold medal, the second-place sprinter receives a silver medal, and the third-place sprinter receives a bronze medal. In the event of a tie, the tied sprinters receive the same color medal. (For example, if there is a two-way tie for first-place, the top two sprinters receive gold medals, the next-fastest sprinter receives a silver medal, and no bronze medal is awarded). Assuming that exactly three medals are awarded, and that the three medal winners stand together with their medals to form a Winner's triangle, how many different Winners' triangles are possible?

A.

24

B.

52

C.

96

D.

144

#### SOLUTION

Solution : B

First, let's consider the different medal combinations that can be awarded to the 3 winners:

(1) If there are NO TIES then the three medals awarded are: GOLD, SILVER, BRONZE.

(2) What if there is a 2-WAY tie?
--If there is a 2-WAY tie for FIRST, then the medals awarded are: GOLD, GOLD, SILVER.
--If there is a 2-WAY tie for SECOND, then the medals awarded are: GOLD, SILVER, SILVER.
--There cannot be a 2-WAY tie for THIRD (because exactly three medals are awarded in total).

(3) What if there is a 3-WAY tie?
--If there is a 3-WAY tie for FIRST, then the medals awarded are: GOLD, GOLD, GOLD.
--There are no other possible 3-WAY ties.
Thus, there are 4 possible medal combinations:

(1) G, S, B      (2) G, G, S      (3) G, S, S      (4) G, G, G

COMBINATION 1: Gold, Silver, Bronze

Number of possibilities = 4×3×2 =24 different Winner's triangles that will contain 1 GOLD, 1 SILVER, and 1 BRONZE medalist.

COMBINATION 2: Gold, Gold, Silver.

Selection =4C3 and arrangement =4!3!(43)!= 4×3=4 ways

COMBINATION 3: Gold, Silver, Silver.
Using the same reasoning as for Combination 2, we see that there are 24 possible Winner's triangles, but only 12 unique Winner's triangles that contain 1 GOLD medalist and 2 SILVER medalists.

COMBINATION 4: Gold, Gold, Gold
Finally , then we have the following:
Selection =4C3 and arrangement =3!2!= 4 ×1=4 ways

Thus, there are 24 + 12 + 12 + 4 = 52 unique Winner's triangles

The correct answer is B.

Consider two points from which two persons start walking towards each other. They cross each other after time T1. They went further to the opposite points and return instantaneously to cross each other again after time T2. Then T2 =

A.

2T1

B.

T1

C.

3T1

D.

32×T1

E.

Data Insufficient

#### SOLUTION

Solution : A

Suppose the distance between the two points is 'd'.

When the persons meet for the first time, total distance covered = d

When persons meet for the second time, total distance covered = d + 2d

Distance = d, time taken = T1; distance = 2d, time taken = 2T1 = T2

Hence Option (a)

Alternative Approach: Using Assumption

You can also solve this using numbers. If the distance is 100 km, and the speed is 50 kmph for each person, they will meet after 12 an hour. They will reach the opposite corners in 1 hour and will meet again in 112 hours; thus T2=1 hour = 2T1. Option (a)