Académique Documents
Professionnel Documents
Culture Documents
NUMBER SYSTEMS
Factors, Multiples, HCF and LCM
If the HCF of two numbers is H, the numbers can be assumed as H a and H
b such that a and b are coprime.
While finding the largest/smallest number that leaves particular remainders
when divided by certain numbers, do not forget to first eliminate options based
on the remainder and divisor combinations, e.g. a number leaving a remainder
of 5 on division by 8 has to be odd; a number leaving a remainder of 3 on
division by 15 has to have the unit digit as 3 or 8; etc.
LCM of multiples of 5 would end with just 0 or 5.
HCF of a set of numbers will be odd if even one of the number in the given set
is odd.
ERROR PRONE AREA: While calculating HCF or LCM of fractions, the
fractions should be in the most reducible form.
The HCF of a set of numbers has to be a factor of the LCM of the set of
numbers OR in other words, the LCM of a set of numbers must be a multiple
of the HCF of the set of numbers. Thus if HCF of a set of numbers is a
multiple of 5, the LCM of the set of numbers must also be a multiple of 5.
Do not forget that for two numbers, the product of numbers = HCF LCM
If a series of numbers is of the type a N + b, then consecutive numbers of
this series differ by N. Conversely any series of numbers differing by N
(basically an AP with common difference N) can be represented as a multiple
of N x.
In any block of N consecutive numbers, there will be one and ONLY one
number belonging to the above series. Thus from 1 to N, there exists one and
ONLY one number belonging to the series. And so also from 101 to 100+N,
or any such block of N numbers.
The above property can be used to identify the range of the smallest or largest
n-digit number of the series. E.g. the smallest 4 digit number of the series 52N
+ 15 will be within 1000 and 1051 and the largest 3 digit number such number
will lie within 948 and 999.
Whenever the number of factors is the focus of any questions, train your mind
to think in the following directionto find the number of factors of any
given number, factorise the number i.e. write it as powers of prime numbers 2
a
3
b
5
c
7
d
11
e
Now the number of factors is (a + 1)(b + 1)(c + 1)(d
+ 1)(e + 1)
The number of ways a given number be written as a product of two numbers =
the number of factor (if number of factors is even) OR
(number of factors + 1) (if number of factors is odd). This will
contain one way of writing the number as a product of similar numbers
i.e. square of the square root of the given number.
Highest power dividing a product/number
To find the highest power of x that divides N!, keep dividing N successively
by x and the addition of all the quotients is your answer. (Successive division
means dividing the quotient of the earlier division). While this is the process
of getting the answer, do understand the concept behind find the highest power
as it may be used in other application. The interpretation of the highest power
of x that divides a factorial is that if from 1 2 3 4 5 6 N, if
all the powers of x is segregated, how many will they amount to. E.g. From
19!, if we segregate all powers of 3 we will have something as follows:
12345(32)78(33)1011(34)1314(35)1617(332)19
i.e. 3
8
N, where N will not be a multiple of 3.
The same logic as above can be used for any product and not necessarily a
factorial. Thus if the questions is what is the highest power of 3 that can divide
the product of squares of all odd numbers from 1 to 20one should identify
that the powers of 3 would appear only in the squares of 3, 9 and 15. Thus the
largest power of 3 dividing the given product is 2 + 4 + 2 = 8.
When the number of zeroes at the end of a product of series of numbers is
asked, think of the highest power of 2 and 5 in the product.
If any number is expressed as 10
n
m, where m is not a multiple of 10, then n
is the number of zeroes at the end of the given number. n is also the highest
power of 10 that divides the given number.
The above property is not just limited to 10. If a number N can be expressed as
7
n
m, where m is not a multiple of 7, then in this case also n is the largest
power of 7 that can divide the given number.
The above rules can be used effectively to factorise a factorial. Thus if one
needs to find the number of ways in which 15! can be written as a product of 2
numbersRecollect from the earlier matter that to find the number of ways
a number can be written as a product of two natural numbers, one has to find
the number of factors of the given number. Also recollect that to find the
number of factors of any given number one has to factorise the given number.
Factorising the given number means writing it in the form of 2
a
3
b
5
c
7
d
11
e
i.e. writing it in powers of prime numbers. Thus we need to find
the highest power of prime numbers that can divide the given number. Thus in
our case 15! can be written as 2
11
3
6
5
3
7
1
11
1
13
1
. Now one can
easily find the number of factors and then half them to get to the answer.
Remainders
To find the remainder when a
b
is divided by c:
First things to check is if a and c have any common factor. If they have a
common factor, do think spend a moment checking if a
b
is a multiple of c. E.g.
What is the remainder when 6
30
is divided by 16? Obviously 6 6 6 6
is divisible by 8 and hence the remainder will be zero.
If a
b
is not a multiple of c, divide both numerator and denominator by the
common factor. This step might reduce your further work. Do remember the
number you have divided the numerator and denominator with. After finding
the remainder of the now reduced numbers, you have to multiply it with this
number to get the correct answer. E.g. What is the remainder if 6
30
is divided
by 40?
30 27 27
6 6 6 6 6 27 6
40 8 5 5