Exams > Cat > Quantitaitve Aptitude
NUMBER SET I MCQs
:
D
Ans: (d)
LCM of (7, 12, 16) = 336. If we divide 1856 by 336 then remainder is 176. Since it is given that remainder in this condition is 4. Hence the least number to be subtracted = (176 - 4) = 172.
Alternate Approach:
In case you don't remember this method: go from answer options by subtracting the answer option from 1856 and divide by each of 7,12, and 16 to get a reminder of 4.
:
C
Ans: (c)
If x=30,
y=16×2=32
Let Roopa have x flowers with her; then
BalancebeforeofferingFlowersofferedBalanceafterofferingIstPlace2xy2x−yIIndPlace4x−2yy4x−3yIIIrdPlace8x−6yy8x−7yIVthPlace16x−14yy16x−15y
16x−15y=0⇒16x=15y⇒y=16x15
:
A
Ans:(a)
There are 50 odd numbers less than 100 which are not divisible by 2. Out of these 50 there are 17 numbers which are divisible by 3. Out of remaining there are 7 numbers which are divisible by 5. Hence numbers which are not divisible by 2, 3, 5 = (50- 17 - 7) = 26
Alternate Approach:
Taking the Euler's number approach:
If we take the prime factors of a number then we get all the numbers that are co-prime to that number, which means all the multiples of the prime factors are removed, using the same formula we can find out the numbers that are not divisible by a particular set of numbers.
100=29
As we don't want the number 2, 3, and 5 also to in the list remove these 3 numbers, hence option will be 26
:
A
Ans: (a)
Let S1 = 1, 2, 3, 4,......., 24, S2 = 50, 49,........., 25;
New series after interchange S1 = 1, 2, 3, 4........, 25, S2 = 50, 49,.......24
It is therefore clear that S1 continues to be in ascending order.
As this is a variable based question: the word "ANY" can be used
Let the series of integers a1,a2,.......,a50 be 1,2,3,4,5,......,50.
S1=1,2,3,4,......24,S2=25,26,27,.........50
:
B
Ans: (b)
This is a generalized question: the important word "ANY" can be used here. Let us solve the question for some prime numbers greater than 6 i.e., 7, 11, 13 and 17. If these numbers are divided by 6, the remainder is always either 1 or 5.
:
D
Ans: (d).
N=553+173−723=(54+1)3+(18−1)3−723
=(51+4)3+173−(68+4)3.
These two different forms of the expression are divisible by 3 and 17 both.
Elimination strategy:
Check the divisibility by 13, it is seen that it is not divisible, now check for 3, it is
divisible, hence the only option will be (d)
:
C
Ans: (c)
D=0. a1a2;100 D=a1a2.a1a2 (recurring); Thus, 99D=a1a2;⇒D=(a1a299)
Required number should thus be a multiple of 99. Hence 198 is the required number.
Three pieces of cakes of weights 412 lbs, 634 lbs and 715 lbs respectively are to be divided into parts of equal weights. Further, each part must be as heavy as possible. If one such part is served to each guest, then what is the maximum number of guests that could be entertained? (CAT 2001)
:
D
Ans: (d)
Total weight of three pieces: =(92+274+365)=35920=18.45 lb.
Required weight of a single piece is HCF of (92+274+365)=HCF of (9,7,36)LCMof(2,4,5)=920 lb.
Number of guests = 18.45(920)=14
:
D
Ans: (d)
53x - 35x = 540; ⇒ 18x= 540 or x = 30; Therefore, new product=53×30=1590.
:
D
Ans: (d)
Given:y=
y =12+13+12+13+.......
Thus y = 12+13+y
y=(3+y)(6+2y+1)⇒2y2+7y=3+y; On solving, y=(−3±√15)2; since the given fraction is positive, the value of y is
(√15−3)2(CAT 2004)