Exams > Cat > Quantitaitve Aptitude
NUMBER SET I MCQs
Total Questions : 90
| Page 2 of 9 pages
Answer: Option A. -> 0
:
A
Sol:
x=163+173+183+193
=(163+193)+(173+183)
=(16+19)(162+16×19+192)+(17+18)(172+17×18+182)
=35× (an odd number) +35× (another odd number)
=35× (an even number) =35×(2k).......... (k is a positive integer)
x=70k
Therefore x is divisible by 70. Remainder when x is divided by 70 = 0
Hence, option 1.
:
A
Sol:
x=163+173+183+193
=(163+193)+(173+183)
=(16+19)(162+16×19+192)+(17+18)(172+17×18+182)
=35× (an odd number) +35× (another odd number)
=35× (an even number) =35×(2k).......... (k is a positive integer)
x=70k
Therefore x is divisible by 70. Remainder when x is divided by 70 = 0
Hence, option 1.
Answer: Option B. -> 6
:
B
Option (b):
Let the number be (10y + x)- (10x + y) = 18
⇒9(y−x)=18⇒y−x=2
So, the possible pairs of (x, y) are
(1, 3), (2, 4), (3, 5), (4, 6), (5, 7), (6, 8) and (7, 9).
But we want the number other than 13. Thus, there are 6 possible numbers, i.e., 24, 35, 46, 57, 68,79.
So, total number of possible numbers are 6.
:
B
Option (b):
Let the number be (10y + x)- (10x + y) = 18
⇒9(y−x)=18⇒y−x=2
So, the possible pairs of (x, y) are
(1, 3), (2, 4), (3, 5), (4, 6), (5, 7), (6, 8) and (7, 9).
But we want the number other than 13. Thus, there are 6 possible numbers, i.e., 24, 35, 46, 57, 68,79.
So, total number of possible numbers are 6.
Answer: Option D. -> R>1
:
D
R=3065−29653064+2964
∵an−bn=(a−b)(an−1+an−2b+an−3b2+.....+bn−1)
∴R=(30−29)[3064+(3063×29)+....+2964]3064+2964
∵3064+3063×29+...+2964>3064+2964
∴R>1
Hence, option 4.
Alternative approach: Unitary Method
R=(3065−2965)(3064+2964)
If you take this number to be of the form 'n' and 'n+1' instead of 30 and 29, you can solve it using simple numbers like 1(n) and 2(n+1)
i.e (23−13)(22+12)=75>1. Only 1 option satisfies this. Option (d)
:
D
R=3065−29653064+2964
∵an−bn=(a−b)(an−1+an−2b+an−3b2+.....+bn−1)
∴R=(30−29)[3064+(3063×29)+....+2964]3064+2964
∵3064+3063×29+...+2964>3064+2964
∴R>1
Hence, option 4.
Alternative approach: Unitary Method
R=(3065−2965)(3064+2964)
If you take this number to be of the form 'n' and 'n+1' instead of 30 and 29, you can solve it using simple numbers like 1(n) and 2(n+1)
i.e (23−13)(22+12)=75>1. Only 1 option satisfies this. Option (d)
Answer: Option D. -> (√15−3)2
:
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)
:
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)
Answer: Option C. -> 9
:
C
Soln:c.
If p=13 and q=23, then p+q=1 and pq=29
a1+b1=p+q=1
a3+b3=p2q+pq2=pq(p+q)=29.
a5+b5=p3q2+p2q3=p2q2(p+q)=481.
So, in general, for odd 'n' we can write
an+bn=(29)(n−12) ; we need to find least value of n such that (29)(n−12)<0.01
Using the options given, if n=7,a7+b7=(29)3>0.01; if n=9,a9+b9=(29)4<0.01
:
C
Soln:c.
If p=13 and q=23, then p+q=1 and pq=29
a1+b1=p+q=1
a3+b3=p2q+pq2=pq(p+q)=29.
a5+b5=p3q2+p2q3=p2q2(p+q)=481.
So, in general, for odd 'n' we can write
an+bn=(29)(n−12) ; we need to find least value of n such that (29)(n−12)<0.01
Using the options given, if n=7,a7+b7=(29)3>0.01; if n=9,a9+b9=(29)4<0.01
Answer: Option D. -> 1590
:
D
Ans: (d)
53x - 35x = 540; ⇒ 18x= 540 or x = 30; Therefore, new product=53×30=1590.
:
D
Ans: (d)
53x - 35x = 540; ⇒ 18x= 540 or x = 30; Therefore, new product=53×30=1590.
Answer: Option D. -> 1
:
D
option (d)
If P=1!=1
Then P+2=3, when divided by 2! Remainder will be 1.
If P=1!+2×2!=5
Then, P+2=7 when divided by 3! Remainder is still 1.
Hence, P=1!+(2+2!)+(3×3!)+.....+(10×10!)
When divided by 11! Leaves remainder 1.
Alternative method :
P=1+2.2!+3.3!+....10.10!
=(2−1)1!+(3−1)2!+(4−1)3!+.....+(11−1)10!
=2!−1!+3!−2!+...+11!−10!
=1+11!
Hence, the remainder is 1.
:
D
option (d)
If P=1!=1
Then P+2=3, when divided by 2! Remainder will be 1.
If P=1!+2×2!=5
Then, P+2=7 when divided by 3! Remainder is still 1.
Hence, P=1!+(2+2!)+(3×3!)+.....+(10×10!)
When divided by 11! Leaves remainder 1.
Alternative method :
P=1+2.2!+3.3!+....10.10!
=(2−1)1!+(3−1)2!+(4−1)3!+.....+(11−1)10!
=2!−1!+3!−2!+...+11!−10!
=1+11!
Hence, the remainder is 1.
Question 18. 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)
Answer: Option D. -> None of these
:
D
Ans: (d)
Total weight of three pieces: =(92+274+365)=35920=18.45lb.
Required weight of a single piece is HCF of (92+274+365)=HCFof(9,7,36)LCMof(2,4,5)=920lb.
Number of guests = 18.45(920)=14
:
D
Ans: (d)
Total weight of three pieces: =(92+274+365)=35920=18.45lb.
Required weight of a single piece is HCF of (92+274+365)=HCFof(9,7,36)LCMof(2,4,5)=920lb.
Number of guests = 18.45(920)=14
Answer: Option C. -> (√13+1)2
:
C
Ans :(c)
x=√4+√4−x
x2=4+√4−x;(x2−4)=√4−x
Only option c satisfies this condition.
Shortcut : Reverse Gear
X=√4+a small value ( note the minus signs inbetween )
⇒ the answer is something slightly greater than 2 .
Look for an answer option, which is slightly greater than 2
(a) 3 is much greater than 2
(b) (√13−1)∼21.1 (this can never be the answer)
(c) (√13+1)∼22.2 (this is a possible answer)
(d) √13= something greater than 3. this is also not possible, as the value is too high
:
C
Ans :(c)
x=√4+√4−x
x2=4+√4−x;(x2−4)=√4−x
Only option c satisfies this condition.
Shortcut : Reverse Gear
X=√4+a small value ( note the minus signs inbetween )
⇒ the answer is something slightly greater than 2 .
Look for an answer option, which is slightly greater than 2
(a) 3 is much greater than 2
(b) (√13−1)∼21.1 (this can never be the answer)
(c) (√13+1)∼22.2 (this is a possible answer)
(d) √13= something greater than 3. this is also not possible, as the value is too high
Question 20. The integers 1,2,...... 40 are written on a blackboard. The following operation is then repeated 39 times; in each repetition, any two numbers, say a and b, currently on the blackboard, are erased and a new number a+b-1 is written. What is the number left on the board at the end? (CAT 2007)
Answer: Option C. -> 781
:
C
option (c) 781
Here, in each step we are adding two number and reducing the sum by 1. So after 39 operations, we will have the sum of all the numbers from 1 to 40 reduced by 39. Hence the final number will be S40−39=781.
:
C
option (c) 781
Here, in each step we are adding two number and reducing the sum by 1. So after 39 operations, we will have the sum of all the numbers from 1 to 40 reduced by 39. Hence the final number will be S40−39=781.