Q1. The number FIVE as written using block capitals contains exactly 10 strokes or segments of a straight line. Find a number which when written out in words (using no tricks) contains as many strokes as the number says.
Q2. The number of 1's in the binary notation of 289 - 1 is
(a) 89
(b) 88
(c) 90
(d) 1
Q3. The highest power of 2 in 10! + 11! + 12! + 13! + ...+ 1000! is
(a) 8
(b) 9
(c) 10
(d) 11
Q4. How many natural numbers between 1 and 900 are NOT multiples of any of the numbers 2, 3, or 5?
a. 650
b. 660
c. 240
d. 250
Q5. Find the remainder when 51138 is divided by 7.
a. 2
b. 1
c. 2138
d. 3
ANS b
Q6. Assume that all bricklayers work at the same rate of speed. If it takes nine bricklayers (all working at the same time) fourteen days to do a job, how long would it take for the job to be done by
a) seven bricklayers
b) three bricklayers.
Q7. If both 112 and 33 are factors of the number a * 43 * 62 * 1311, then what is the smallest possible value of a?
1. 121
2. 3267
3. 363
4. 33
Correct choice (3). Correct Answer - (363
Q8. What is the remainder when 62002 is divided by 11?
Q9. Let x = 1! + 2! + 3! + 4! + ... + 100!. Unit's digit of Xxxx...x is
a. 3
b. 1
c. 1 or 3 depending upon the number of times x appears in the power.
d. can't be determined.
ANS: d
Q10. Let (x, y) be co-prime numbers. Then
(a) x + y and x - y have no common factor other than 1 and 3 for all values of x and y.
(b) x + y and x - y have no common factor other than 1 and 2 for all values of x and y.
(c) x + y and x - y have no common factor other than 1 for all values of x and y.
(d) none of the above
Q11. What is the least number that should be multiplied to 100! To make it perfectly divisible by 718
a. 1
b. 7
c. 21
d. 49
Q12. A car has traveled 24,000 km and, in that distance, has worn out 6 tyres. Each tyre travelled the same distance. How far did each separate tyre travel?
Q13. There were 90 questions in an exam. If 1 mark was awarded for every correct answer and 1/3rd mark was deducted for every wrong answer, how many different net scores were possible in the exam?
a. 120
b. 359
c. 358
d. 360
ans: 358
Q14. If x = 15 x 30 x 45 .... 1500, then how many zeros are there at the end of x?
a. 24
b. 124
c. 97
d. 50
Q1. The number FIVE as written using block capitals contains exactly 10 strokes or segments of a straight line. Find a number which when written out in words (using no tricks) contains as many strokes as the number says.
Solution:
TWENTY – NINE is the number which is written with as many strokes as the value of the number it states.
Q2. The number of 1's in the binary notation of (2^89) – 1 is
(a) 89
(b) 88
(c) 90
(d) 1
Solution:
(2^1) – 1 when written in the binary notation is written as 1 and thus contains one 1.
(2^2) – 1 when written in the binary notation is written as 11 and thus contains two 1s.
(2^3) – 1 when written in the binary notation is written as 111 and thus contains three 1s.
(2^4) – 1 when written in the binary notation is written as 1111 and thus contains four 1s.
……………………
……………………
……………………
……………………
and so on.
Now, make a note of the pattern that is being followed and we can conclude that (2^89)- 1 when written in the binary notation, will contain eighty – nine 1s.
Q3. The highest power of 2 in 10! + 11! + 12! + 13! + ...+ 1000! is
(a) 8
(b) 9
(c) 10
(d) 11
Solution:
The highest power of 2 contained in the sum of a set of factorials of different numbers is equal to the highest power of 2 contained in the least of those numbers because the highest power of 2 contained in the rest of them will always be greater than or equal to the highest power of 2 contained in the least of them.
Hence in the given problem, the highest power of 2 will be equal to the highest power of 2 contained in 10! and that is equal to 8.
Q4. How many natural numbers between 1 and 900 are NOT multiples of any of the numbers 2, 3, or 5?
a. 650
b. 660
c. 240
d. 250
Solution:
The natural numbers between 1 and 900 that are divisible by 2 are: 2, 4, 6, 8, 10, 12, 14, 16, 18, … , 900 and there are altogether 450 such numbers.
The natural numbers between 1 and 900 that are divisible by 3 are: 3, 6, 9, 12, 15, 18,…, 900 and there are altogether 300 such numbers.
The natural numbers between 1 and 900 that are divisible by 5 are: 5, 10, 15, 20, 25, 30, 35, 40, …, 900 and there are altogether 180 such numbers.
The natural numbers between 1 and 900 that are divisible by both 2 and 3 are: 6, 12, 18, 24, 30, 36, …, 900 and there are altogether 150 such numbers.
The natural numbers between 1 and 900 that are divisible by both 3 and 5 are: 15, 30, 45, 60, 75, 90, …, 900 and there are altogether 60 such numbers.
The natural numbers between 1 and 900 that are divisible by both 5 and 2 are: 10, 20, 30, 40, 50, 60, …, 900 and there are altogether 90 such numbers.
The natural numbers between 1 and 900 that are divisible by 2, 3 and 5 are: 30, 60, 90, 120, 150, 180, …, 900 and there are altogether 30 such numbers.
So the number of numbers between 1 and 900 (both inclusive), that are divisible by at least one of 2, 3 or 5 is given by: The number of numbers divisible by 2 + The number of numbers divisible by 3 + The number of numbers divisible by 5 – The number of numbers divisible by both 2 and 3 – The number of numbers divisible by both 3 and 5 – The number of numbers divisible by both 5 and 2 + The number of numbers divisible by 2, 3 and 5 = 450 + 300 + 180 – 150 – 90 – 60 + 30 = 660.
Hence the number of natural numbers between 1and 900 that are NOT divisible by any of 2, 3 and 5 are: 900 – 660 = 240, which is the required answer.
Q6. Assume that all bricklayers work at the same rate of speed. If it takes nine bricklayers (all working at the same time) fourteen days to do a job, how long would it take for the job to be done by
a) Seven bricklayers
b) Three bricklayers.
Solution:
Here we will be using the result (M1 x D1)/(W1) = (M2 x D2)/(W2)
Where M denotes the number of men involved in doing the work, D denotes the number of days required to complete the work and W denotes the quantity of work done or to be done (and is generally taken as 1, unless the exact work is specified)
Solution (a):
M1 = 9, D1 = 14, W1 = 1, M2 = 7, W2 = 1 (as the same work is to be done)
(M1 x D1)/(W1) = (M2 x D2)/(W2)
or, (9 x 14)/(1) = (7 X D2)/(1)
or. D2 = (9 x 14)/(7) = 9 x 2 = 18 days, which is the required answer.
Solution (b):
M1 = 9, D1 = 14, W1 = 1, M2 = 3, W2 = 1 (as the same work is to be done)
(M1 x D1)/(W1) = (M2 x D2)/(W2)
or, (9 x 14)/(1) = (3 X D2)/(1)
or. D2 = (9 x 14)/(3) = 3 x 14 = 42 days, which is the required answer.
Q7. If both 11^2 and 3^3 are factors of the number (a) * (4^3) * (6^2) * (13^11), then what is the smallest possible value of a?
1. 121
2. 3267
3. 363
4. 33
Solution:
The expression (a) * (4^3) * (6^2) * (13^11) can also be written as
(a) * {(2^2)^3} * {(3 * 2)^2} * (13^11)
= (a) * (2^6) * (3^2) * (2^2) * (13^11)
= (a) * (2^8) * (3^2) * (13^11)
Now, it is given that both 11^2 and 3^3 are factors of the given number. That is, (11^2) * (3^3) is a factor of the given number.
Now in the simplified form of the given number, we can see that it already contains the factor 3. Hence ‘a’ has to contain at least 11^2 and 3 as its factors and so, the minimum value of ‘a’ has to be (11^2) * (3) = 121 * 3 = 363.
Q8. What is the remainder when 6^2002 is divided by 11?
Solution:
Fermat’s Theorem states that: “If p be a prime number and ‘a’ be a number not divisible by p, then (a)^(p – 1), when divided by p, the remainder is always 1”.
In the given problem, we see that 11 is a prime number and 6 is not divisible by 11 and so we can use Fermat’s Theorem in the given problem.
So, (6)^10 when divided by 11, the remainder is 1.
Therefore, 6^2000 = {(6)^10}^200 when divided by 11, the remainder will be (1)^200 = 1.
Now, 6^2002 = (6^2000)*(6^2), and when 6^2 is divided by 11, the remainder is 3.
So the remainder when 6^2002 is divided by 11, the remainder is (1)*(3) = 3.
Q9. Let x = 1! + 2! + 3! + 4! + ... + 100!. Unit's digit of x^x^x^x^x^x …… is
a. 3
b. 1
c. 1 or 3 depending upon the number of times x appears in the power.
d. Can’t be determined.
ANS: d
Solution:
We first calculate the last two digits of the sum of these numbers.
1! = 01
2! = 02
3! = 06
4! = 24
5! = 20
6! = 20
7! = 40
8! = 20
9! = 80
10! = 00
11! = 00
12! = 00
……………………
……………………
……………………
……………………
and so on.
Note that for all the numbers from 10! Onwards, the last two digits will be 00. hence we now find the sum of the last two digits of the numbers from 1! to 9! And obtain the last two digits as 13. So, the last two digits of the number x = 1! + 2! + 3! + 4! + ... + 100! Is 13.
Now, we know that the cycle of 3 is 3, 9, 7, 1 so to find the digit in the unit’s place of any number ending in 3, we have to express the power of that number in the form 4k + r, where k is the quotient and r is the remainder when the power of the number is divided by 4.
We also make a note of a property that if the last digit of a number be a and if it is raised to any power which is of the form 4k + 1, then the last digit of the result will always be a.
In the given problem, note that the last digit of the number x is 3 and the last two digits of the number x is 13. So this number x can be expressed in the form 4k + 1 and thus using the above mentioned property, we can conclude that the last digit of the number x^x^x^x^x^x …… is 3.
commented on: Fri, 2007-07-13 17:37
cat2007 points: 98
Location:
Comments : 3
Q9
Hi
can anyone solve 9th ques
thanks
commented on: Sat, 2007-07-14 21:34
Ravi Raja points: 1211
Location:Calcutta
Comments : 163
Question 1
Q1. The number FIVE as written using block capitals contains exactly 10 strokes or segments of a straight line. Find a number which when written out in words (using no tricks) contains as many strokes as the number says.
Solution:
TWENTY – NINE is the number which is written with as many strokes as the value of the number it states.
2 + 4 + 4 + 3 + 2 + 3 + 3 + 1 + 3 + 4 = 29
Thank You.
Ravi Raja
commented on: Sat, 2007-07-14 21:34
Ravi Raja points: 1211
Location:Calcutta
Comments : 163
Question 2
Q2. The number of 1's in the binary notation of (2^89) – 1 is
(a) 89
(b) 88
(c) 90
(d) 1
Solution:
(2^1) – 1 when written in the binary notation is written as 1 and thus contains one 1.
(2^2) – 1 when written in the binary notation is written as 11 and thus contains two 1s.
(2^3) – 1 when written in the binary notation is written as 111 and thus contains three 1s.
(2^4) – 1 when written in the binary notation is written as 1111 and thus contains four 1s.
……………………
……………………
……………………
……………………
and so on.
Now, make a note of the pattern that is being followed and we can conclude that (2^89)- 1 when written in the binary notation, will contain eighty – nine 1s.
Thank You.
Ravi Raja
commented on: Sat, 2007-07-14 21:35
Ravi Raja points: 1211
Location:Calcutta
Comments : 163
Question 3
Q3. The highest power of 2 in 10! + 11! + 12! + 13! + ...+ 1000! is
(a) 8
(b) 9
(c) 10
(d) 11
Solution:
The highest power of 2 contained in the sum of a set of factorials of different numbers is equal to the highest power of 2 contained in the least of those numbers because the highest power of 2 contained in the rest of them will always be greater than or equal to the highest power of 2 contained in the least of them.
Hence in the given problem, the highest power of 2 will be equal to the highest power of 2 contained in 10! and that is equal to 8.
Thank You.
Ravi Raja
commented on: Sat, 2007-07-14 21:35
Ravi Raja points: 1211
Location:Calcutta
Comments : 163
Question 4
Q4. How many natural numbers between 1 and 900 are NOT multiples of any of the numbers 2, 3, or 5?
a. 650
b. 660
c. 240
d. 250
Solution:
The natural numbers between 1 and 900 that are divisible by 2 are: 2, 4, 6, 8, 10, 12, 14, 16, 18, … , 900 and there are altogether 450 such numbers.
The natural numbers between 1 and 900 that are divisible by 3 are: 3, 6, 9, 12, 15, 18, …, 900 and there are altogether 300 such numbers.
The natural numbers between 1 and 900 that are divisible by 5 are: 5, 10, 15, 20, 25, 30, 35, 40, …, 900 and there are altogether 180 such numbers.
The natural numbers between 1 and 900 that are divisible by both 2 and 3 are: 6, 12, 18, 24, 30, 36, …, 900 and there are altogether 150 such numbers.
The natural numbers between 1 and 900 that are divisible by both 3 and 5 are: 15, 30, 45, 60, 75, 90, …, 900 and there are altogether 60 such numbers.
The natural numbers between 1 and 900 that are divisible by both 5 and 2 are: 10, 20, 30, 40, 50, 60, …, 900 and there are altogether 90 such numbers.
The natural numbers between 1 and 900 that are divisible by 2, 3 and 5 are: 30, 60, 90, 120, 150, 180, …, 900 and there are altogether 30 such numbers.
So the number of numbers between 1 and 900 (both inclusive), that are divisible by at least one of 2, 3 or 5 is given by: The number of numbers divisible by 2 + The number of numbers divisible by 3 + The number of numbers divisible by 5 – The number of numbers divisible by both 2 and 3 – The number of numbers divisible by both 3 and 5 – The number of numbers divisible by both 5 and 2 + The number of numbers divisible by 2, 3 and 5 = 450 + 300 + 180 – 150 – 90 – 60 + 30 = 660.
Hence the number of natural numbers between 1and 900 that are NOT divisible by any of 2, 3 and 5 are: 900 – 660 = 240, which is the required answer.
Thank You.
Ravi Raja
commented on: Sat, 2007-07-14 21:36
Ravi Raja points: 1211
Location:Calcutta
Comments : 163
Question 5
Q5. Find the remainder when 51^138 is divided by 7.
a. 2
b. 1
c. 2138
d. 3
Solution:
(51)^138 = (49 + 2)^138
So the remainder when 51^138 is divided by 7 is the same as the remainder when 2^138 is divided by 7.
Now, 2^138 = (2^3)^46 = (8)^46 = (7 + 1)^46
So the remainder when 2^138 is divided by 7 is the same as the remainder when (7 + 1)^46 is divided by 7 and that is equal to 1.
Hence the remainder when 51^138 is divided by 7, the remainder is 1.
Thank You.
Ravi Raja
commented on: Sat, 2007-07-14 21:37
Ravi Raja points: 1211
Location:Calcutta
Comments : 163
Question 6
Q6. Assume that all bricklayers work at the same rate of speed. If it takes nine bricklayers (all working at the same time) fourteen days to do a job, how long would it take for the job to be done by
a) Seven bricklayers
b) Three bricklayers.
Solution:
Here we will be using the result (M1 x D1)/(W1) = (M2 x D2)/(W2)
Where M denotes the number of men involved in doing the work, D denotes the number of days required to complete the work and W denotes the quantity of work done or to be done (and is generally taken as 1, unless the exact work is specified)
Solution (a):
M1 = 9, D1 = 14, W1 = 1, M2 = 7, W2 = 1 (as the same work is to be done)
(M1 x D1)/(W1) = (M2 x D2)/(W2)
or, (9 x 14)/(1) = (7 X D2)/(1)
or. D2 = (9 x 14)/(7) = 9 x 2 = 18 days, which is the required answer.
Solution (b):
M1 = 9, D1 = 14, W1 = 1, M2 = 3, W2 = 1 (as the same work is to be done)
(M1 x D1)/(W1) = (M2 x D2)/(W2)
or, (9 x 14)/(1) = (3 X D2)/(1)
or. D2 = (9 x 14)/(3) = 3 x 14 = 42 days, which is the required answer.
Thank You.
Ravi Raja
commented on: Sat, 2007-07-14 21:37
Ravi Raja points: 1211
Location:Calcutta
Comments : 163
Question 7
Q7. If both 11^2 and 3^3 are factors of the number (a) * (4^3) * (6^2) * (13^11), then what is the smallest possible value of a?
1. 121
2. 3267
3. 363
4. 33
Solution:
The expression (a) * (4^3) * (6^2) * (13^11) can also be written as
(a) * {(2^2)^3} * {(3 * 2)^2} * (13^11)
= (a) * (2^6) * (3^2) * (2^2) * (13^11)
= (a) * (2^8) * (3^2) * (13^11)
Now, it is given that both 11^2 and 3^3 are factors of the given number. That is, (11^2) * (3^3) is a factor of the given number.
Now in the simplified form of the given number, we can see that it already contains the factor 3. Hence ‘a’ has to contain at least 11^2 and 3 as its factors and so, the minimum value of ‘a’ has to be (11^2) * (3) = 121 * 3 = 363.
Thank You.
Ravi Raja
commented on: Sat, 2007-07-14 21:38
Ravi Raja points: 1211
Location:Calcutta
Comments : 163
Question 8
Q8. What is the remainder when 6^2002 is divided by 11?
Solution:
Fermat’s Theorem states that: “If p be a prime number and ‘a’ be a number not divisible by p, then (a)^(p – 1), when divided by p, the remainder is always 1”.
In the given problem, we see that 11 is a prime number and 6 is not divisible by 11 and so we can use Fermat’s Theorem in the given problem.
So, (6)^10 when divided by 11, the remainder is 1.
Therefore, 6^2000 = {(6)^10}^200 when divided by 11, the remainder will be (1)^200 = 1.
Now, 6^2002 = (6^2000)*(6^2), and when 6^2 is divided by 11, the remainder is 3.
So the remainder when 6^2002 is divided by 11, the remainder is (1)*(3) = 3.
Thank You.
Ravi Raja
commented on: Sat, 2007-07-14 21:38
Ravi Raja points: 1211
Location:Calcutta
Comments : 163
Question 9
Q9. Let x = 1! + 2! + 3! + 4! + ... + 100!. Unit's digit of x^x^x^x^x^x …… is
a. 3
b. 1
c. 1 or 3 depending upon the number of times x appears in the power.
d. Can’t be determined.
ANS: d
Solution:
We first calculate the last two digits of the sum of these numbers.
1! = 01
2! = 02
3! = 06
4! = 24
5! = 20
6! = 20
7! = 40
8! = 20
9! = 80
10! = 00
11! = 00
12! = 00
……………………
……………………
……………………
……………………
and so on.
Note that for all the numbers from 10! Onwards, the last two digits will be 00. hence we now find the sum of the last two digits of the numbers from 1! to 9! And obtain the last two digits as 13. So, the last two digits of the number x = 1! + 2! + 3! + 4! + ... + 100! Is 13.
Now, we know that the cycle of 3 is 3, 9, 7, 1 so to find the digit in the unit’s place of any number ending in 3, we have to express the power of that number in the form 4k + r, where k is the quotient and r is the remainder when the power of the number is divided by 4.
We also make a note of a property that if the last digit of a number be a and if it is raised to any power which is of the form 4k + 1, then the last digit of the result will always be a.
In the given problem, note that the last digit of the number x is 3 and the last two digits of the number x is 13. So this number x can be expressed in the form 4k + 1 and thus using the above mentioned property, we can conclude that the last digit of the number x^x^x^x^x^x …… is 3.
Thank You.
Ravi Raja