NUMBERS - PPT Gen Aptitude - 1st Yr SRM
NUMBERS - PPT Gen Aptitude - 1st Yr SRM
NUMBERS - PPT Gen Aptitude - 1st Yr SRM
SUBTOPICS:
1. CLASSIFICATION OF NUMBERS
2. DIVISIBILITY RULES
3. RECURRING DECIMALS
4. FACTORS
7. NUMNBER OF ZERO’S
10 DIVISION ALGORITHM
CLASSIFICATION OF NUMBERS:
REAL NUMBERS: Both rational and irrational numbers are real numbers.
SET OF INTEGERS: All negative integers, zero and all positive integers.
PROBLEMS:
3. A wants to type first 1000 natural numbers. How many times he has to press the
buttons of a computer key board?
a) 2893 b) 2987 c) 3000 d) 2500
5. One page is torn from a booklet whose pages are numbered in the usual
manner starting from the first page 1. The sum of the numbers on the
remaining pages is 195. The torn page contains which of the following
numbers?
a) 5, 6 b) 7, 8 c) 9, 10 d) 11, 12
Sol: Here, basically, our sum of first n natural numbers should be slightly greater
than 195.
By trial and error, if n = 10, then [n (n+1)]/2 = (10 x 11)/2 = 55
if n = 15, then [n (n+1)]/2 = (15 x 16)/2 = 120
if n = 20, then [n (n+1)]/2 = (20 x 21)/2 = 210
So, 210 – 195=15.That is the torn page contains pages 7 and 8
DIVISIBILITY RULES
4. BY 11: A number is divisible by 11, if the difference between the sum of the
digits in odd places and the sum of the digits in even places is 0 or a multiple of
11.
5. In case of composite numbers:
a) Divisible by 6: Check with 2 and 3
b) D Divisible by 12: Check with 3 and 4
c) Divisible by 18: Check with 2 and 9
d) Divisible by 24: Check with 8 and 3
That is, for composite numbers we need to check with co prime pair
PROBLEMS:
9. What is the remainder when the 100 digit number starting with 1, writing the
consecutive natural numbers next to it, is divided by 5?
a) 1 b) 2 c) 4 d) 0
Sol: Here we need to know the last digit of this 100 digit number.
The 100 digit number is 1234…..9101112…….545 (that is 9 single digit
numbers, then 45 two digit numbers, 10 to 54 and then 5)
So the remainder is 0
10 If the 8 digit number 5668x25y is divisible by 48, find the least value of x+y
a) 10 b) 9 c) 8 d) 7
Sol: Divisibility by 48 means we need to check with 3 and 16.
Sum of the digits of 5668x25y = 32+(x + y)
Among the options if (x + y) is 7 or 10 then only it is divisible by 3.
Divisibility by 16 means we need to check last 4 digit number and for 8 we
have to check the last 3 digit number.
25y is divisible by 8, implies y = 6
If x= 1, then the 4 digit number 1256 is not divisible by 16.
Hence the value of (x+y) is 10
RECURRING DECIMALS
PROBLEMS:
Short cut: Take the repeated digits once in the numerator and the number of
9’s corresponding to the number of repeated digits in the denominator.
That is = 057/999 = 57/999
12. The value of 0.1254545454………. is (that is 0.1254)
a) 1242/(9900) b) 621/(2950) c) 207/(1650) d) 69/(550)
FACTORS:
NOTE:
1. Prime numbers contain exactly 2 factors.
2. Squares of primes contain exactly 3 factors.
3. Any perfect square contains odd number of factors.
PROBLEMS:
15. Find the number of factors 19404, excluding 1 & the number itself?
a) 52 b) 54 c) 58 d) 59
16. In how many ways can 3420 be written be written as product of 2 factors?
a) 12 b) 14 c) 18 d) 36
17. Find the number of odd & even number of factors of 1680?
a) 8, 32 b) 8, 9 c) 10, 9 d) none
Sol: 120 = 40 x 3 = 8 x 5 x 3 = 23 x 51 x 31
Sum of all the factors = [ ap+1 – 1] / (a-1) x [bq+1 – 1] / (b-1) x ……….
= 360
20. What is the smallest number that should multiply 840 to make it a
perfect square and 2940 to make it a perfect cube respectively?
a) 200, 3100 b) 210, 3150 c) 210, 3250 d) None
Note:
1. To make it a perfect square, make the powers of prime factors a multiple of 2
2. To make it a perfect cube, make the powers of prime factors a multiple of 3
Sol:
a) 840 = 23 x 51 x 31 x 71, answer = 2 x 5 x 3 x 7 = 210
FORMULE:
1 . Product of 2 numbers = LCM X HCF
PROBLEMS:
22. The HCF of 2 numbers is 16 and their LCM is 160. If one of the numbers is 32,
what is the other?
a) 60 b) 80 c) 40 d) 20
Sol: We have, Product of 2 numbers = LCM X HCF
32 * x = 16 * 160, implies x = 80
23. Find the least number which when divided by 48 and 72 leaves a remainder of 9 in
each case and is greater than 9?
a) 144 b) 152 c) 151 d) 153
Sol: Required number = LCM of (48, 72) +9
= 144 + 9 = 153
24. What is least 4 digit number which when divided by 3, 4, 5 and 6 leaves
remainder of 2 in each case?
a) 1012 b) 1022 c) 1122 d) 1222
Sol: Required number will be of the form = k [LCM of (3, 4, 5, 6)] + 2
= 60k +2
When k = 17, we get the least 4 digit number, which is 1020 +2 = 1022
25. Find the smallest number which when divided by 3,5,7,9 and 11 leaves respective
remainder of 2,4,6,8 and 10?
a) 2265 b) 2275 c) 2274 d) 3464
Sol: Here the difference between the divisor and the remainder is 1
Required number = LCM of (3, 5, 7, 9 and 11) – 1
= 3365 – 1
= 3364
26. Find the smallest number which leaves a remainder of 7 when divided by 11 and
leaves a remainder of 12 when divided by 13?
a) 51 b) 62 c) 72 d) 36
Sol: Using the division algorithm (N = dq +r) we can write the number as
N = 11a + 7 = 13b + 12
11a = 13b + 5
Now find the least value of ‘b’ so that ‘a’ is an integer.
We can easily see that when b = 3, ‘a’ is an integer.
So the required number = 13b +12 = 51
27. Find the smallest and largest 3 digit number which when divided by 22, 33 and 55
leave a remainder of 5 in each case?
a) 330, 990 b) 345, 980 c) 335, 995 d) 325, 925
Sol: Number form = k (LCM of 22, 33 and 55) + 5
= 330k +5
For smallest 3 digit number, put k = 1, N = 335
For greatest 3 digit number, put k = 3, N = 995
28. Find the smallest and the largest 4 digit number which when decreased by 12 is
exactly divisible by 16, 24 and 40?
a) 1208, 9848 b) 1200, 9840 c) 1212, 9852 d) 1188, 9828
Sol: Number form = k (LCM of 16, 24 and 40) + 12
= 240k +12
For smallest 4 digit number, put k = 17, N = 1212
For greatest 4 digit number, put k = 41, N = 9852
29. Six bells ring together at 11am and after that they ring at intervals of 5, 10, 15, 25,
30 seconds. How many times will they ring together from 11.00 am to 12.30
pm on the same day?
a) 18 b) 19 c) 20 d) 17
Sol: LCM of (5, 10, 15, 25, 30) = 300 seconds = 5 minutes
So, answer = (90/5) + 1 = 19
30. Find the greatest number which when 110 and 99 are divided it leaves a remainder
of 2 and 3 respectively?
a) 24 b) 6 c) 12 d) 36
Sol: Required number = HCF of [(110 – 2), (99 – 3)
= HCF of (108, 96)
= 12
31. Find the largest number which when 145, 121, 97 are divided the remainders are
same?
a) 48 b) 12 c) 36 d) 24
Sol: Required number = HCF of [(145 – 121), (121 – 97)]
= HCF of (24, 24)
= 24
32. What is the greatest length x such that 3½ m and 8¾ m are integral
multiples of x?
a)1 ½ m b) 1 1/3 m c) 1 ¼ m d) 1 ¾ m
Sol: 3½ = 7/2
8¾ = 35/4
HCF of fractions = (HCF of numerators)/(LCM of denominators)
= (HCF of 7, 35)/(LCM of 2, 4)
= 7/4
=1¾m
LARGEST POWER OF A NUMBER IN N!
Sol: 100/2 = 50 + 25 + 12 + 6 + 3 + 1 = 97
Sol: 100/3 = 33 + 11 + 3 + 1 = 48
Sol: 24 = 8 x 3 = 23 x 3.
In 500!,number of 8’s are lesser compare to number of 3’s. So we need to find
only number of 8’s
Number of 2’s in 500!, 500/2 = 250+125+62+31+15+7+3+1 = 494
Therefore number of 8’s in 500! = 494/3 =164
Sol:
1 5 10 15 20 25 30 35 40 45 50 55 60
5’s 0 1 1 1 1 2 1 1 1 1 2 1 1
2’s 0 0 1 0 2 0 1 0 3 0 1 0 2
NOTE:
a) Last digit of (even number)4k = 6
b) Last digit of (odd number)4k = 1
c) If the number ends with 0 and raised to any power, the last digit = 0
d) If the number ends with 5 and raised to any power, the last digit = 5
PROBLEMS:
Sol: 299 = 296 x 23 = 4 x 8 = 2 (296 is in 24k form, the last digit is 6 & 23 ends with 8)
Sol: (1567)143 = 73 = 3
(1239)197 = 91 = 9
(2566)1027= 6
Answer = 3 x 9 x 6 = 6
FINDING THE REMAINDERS
47. Find the remainder when (1251 x 1252 x 1253) is divided by 11?
a) 6 b) 9 c) 8 d) 7
Sol: we have to find the remainder when (1251 x 1252 x 1253) is divided by 11?
Now Remainder of [(1251)/11] = 8
Remainder of [(1252)/11] = 9
Remainder of [(1253)/11] = 10
Therefore Remainder of [(8 x 9 x 10)/11] = (-3) x (-2) x (-1) = 6
48. A number when divided by 161 leaves a remainder of 57. Find the remainder
when the same number is divided by 7?
a) 0 b) 1 c) 2 d) 3
Sol: A number when divided by 161 leaves a remainder of 57.
Using the division algorithm we can write the number as, N = 161q + 57
Now R (N/7) = R [(161q +57)]/7 = 1 (since 161 is divisible by 7 & when 57 is
divided by 7, the remainder is 1)
49. A number when divided by a certain divisor leaves a remainder of 19. When twice
the number is divided by the same divisor, the remainder is 7. Find the divisor?
a) 14 b) 21 c) 31 d) cannot be determined
Sol: A number when divided by a certain divisor leaves a remainder of 19.
Using the division algorithm we can write the number as, N = d x q + 19
Now twice the number, 2N = 2 d x q + 38
Given, R (2N)/d = 7
That is R (2 d x q + 38)/d = 7, implies d must be 31
50. A number when divided by a certain divisor leaves a remainder of 11.When the
Square of the same number is divided by the same divisor the remainder is 1. How
many values are possible for the divisor?
a) 10 b) 11 c) 12 d) None
Sol: Given, a number N, when divided by a certain divisor d leaves a remainder of 11.
Using the division algorithm we can write the number as, N = d x q + 11
Now square of the number, N2 = d2q2 +22 x d x q + 121
Here d2q2 is divisible by d and (22 x d x q) is also divisible by d.
That means R (121/d) = 1, means 120 is divisible by d
That means d can be any factor of 120, greater than 11.
Therefore d can be 12, 15, 20, 24, 30, 40, 60 and 120.
So, 8 values are possible for d.