1) the expression 333^555+555^333 is divisible by
a) 2 b) 3 c) 37 d)11
Clearly divisible by 3, 37 and 2. So, its not divisible by 11
2) Define a number K such that it is the sum of squares of first M natural numbers(i.e. K=1^2+2^2+...+M^2), where M a) 10 b)11 c)12 d)none
K = n(n + 1)(2n + 1)/6
=> One of n and (n + 1) should be divisible by 8
=> n = 8k or 8k - 1
=> n can take 12 values (7, 8, 15, 16, ...., 47, 4

4) find the 28383rd term of the series 123456789101112...
a) 3 b)4 c)9 d)7
Check post #3499 of this page
http://www.pagalguy.com/discussions/quant-by-arun-sharma-250238135) If you form a subset of integers chosen from between 1 to 3000, such that no two integers add up to a multiple of nine, what can be the maximum number of elements in the subset?
a) 1970 b)1971 c)1972 d)none
We should have all numbers of form 9k + 1, 9k + 2, 9k + 3, 9k + 4 and one number of form 9k
=> 334 + 334 + 334 + 333 + 1 = 1336
6) A triangular number is defined as a number which has the property of being expressed as a sum of consecutive natural numbers starting with 1. how many triangular numbers less than 1000, have the property that they are difference of squares of two consecutive natural numbers?
a) 20 b)21 c)22 d)23
Triangular numbers are of form n(n + 1)/2.
Any number that can be written as difference of squares of two consecutive natural numbers are odd numbers
=> n(n + 1)/2 should be odd
=> n should be of form 4k - 2 or 4k - 3
Also, n(n + 1)/2 => n => 22 such numbers
7) The remainder when number 123456789101112...484950 is divided by 16 is
a) 3 b)4 c)5 d)6
Consider just last 4 digits and find the remainder, i.e., 4950/16. So remainder will be 6
What is the remainder when (1!)^3+(2!)^3+...(1152!)^3 is divided by 1152?
a)125 b)225 c)325 d)205
Check this page:-
http://www.pagalguy.com/discussions/official-quant-thread-for-cat-2010-part2-250550139) What is the remainder when 2(8!)-21(6!) divides 14(7!)+14(13!)?
a) 1 b)7! c)8! d)9!
2(8!)-21(6!)
= 2*8(7!)-3(7)(6!)
= 16(7!) - 3(7!)
= 13(7!)
14(7!)+14(13!)
= 14(7!)+14(13!)
= (1+13)(7!) + 14(13!)
= 7! + 13(7!) + 14(13!)
=> Remainder will be 7!
10) How many integer values are there such that 4x+7y=3, while x a) 144 b)141 c)143 d)142
Check this page:-
http://www.pagalguy.com/discussions/quant-by-arun-sharma-2502381312) N=202x20002x200000002x20000000000000...2(31 zeroes), the sum of digits in this multiplication will be?
a)112 b)160 c)144 d) cant be detrmined.
N = 202x20002x200000002x20000000000000...2(31 zeroes)
= 2^5 * 101x10001x100000001x10000000000000...1(31 zeroes)
= 32(10^2 + 1)(10^4 + 1)(10^8 + 1)(10^16 + 1)(10^32 + 1)
= 32(10^62 + 10^60 + .... + 10^2 + 1)
= 3232323232....64 digits
=> Sum = 5*32 = 160
13) Find the remainder when (50^56)^52 is divided by 11?
a) 7 b)5 c)9 d)10
I think the question is 50^(56^52)
Euler's number of 11 is 10
=> We need to find the remainder when 56^52 is divided by 10, i.e., 6
=> Question reduces to 50^6 (mod 11) = 6^6 (mod 11) = 36^3 (mod 11) = 3^3 (mod 11) = 5 (mod 11)
=> remainder will be 5