number system concepts

LCM (Least Common Multiple)
The least common multiple of two numbers is the smallest positive number that is a multiple of both.

Multiple of 3 – 3, 6, 9, 12, 15, 18,…………..
Multiple of 4 –  4, 8, 12, 16, 20, 24,………….
so the LCM of 3 and 4 is 12.

An example of LCM:

The LCM of 10, 20, 25 is 100. It means that 100 is the lowest common multiple of these three numbers , but there is a question in our mind that can the LCM be (-100)? Since (-100) is lower than 100 and divisible by each of 10, 20, 25, or can it be zero or what will be the lcm of (-10) and 20? Will it be (-20) or (-200)?

For all these questions, they one answer that the LCM is only defined for positive numbers and LCM is not defined for 0

PROCESS OF FINDING LCM

  • We will do  in first step is factorisation
  • Then we will sort all the distinct factors
  • Then in last step we raise the factor to its highest power
[one_half_last]

LCM and HCF Tests

The objective of the two tests below is to check your knowledge of the basics of the topic. Solve these tests to check your grasp of the topic.
number system test for HCF and LCM

number system test for HCF and LCM[/one_half_last]

Example 1:LCM of   10,20, 25  is ?

Step 1: 10= 21 * 51
: 20 = 251
: 25= 52
 Step 2: 2, 5
Step 3 : 252

With this method, we can find LCM of any number.

Example 2: What is the LCM of 35, 45, 55?
Now here we go by another method, firstly find the LCM of 35 and 45.
Now these two numbers can be broken into:  35 = 51 *  7and 45 = 32 *  51.
So it can be observed there is no 3 so we have to multiply 35 with 3 so LCM of 35 and 45 =35 * 32 .
Now we have to find the LCM of 35* 32 and 55 which can be written as 51 * 11
So, finally the LCM OF = 35,45,55, is 3465.

Another Method to calculate LCM of Numbers:

Division method is an another method to find the L.C.M. and H.C.F. of numbers
Let’s take an example to understand it:

Example 3: Find the L.C.M. of 18, 24, and 36?
To find the L.C.M. of 18, 24, 36 we will follow the following steps:
1. First we will write the numbers in ascending order
2. Now we will divide the numbers with a common prime factor
Remember if a number is not divisible by this prime number, then write the number as it is.
For L.C.M. of 18, 24, and 36 the common prime factors are 2 and 3


So the L.C.M. of 18, 24, and 36 is given by 2x2x3x2x3=72

HCF ( HIGHEST COMMON MULTIPLE )

Factors are those +ve integral values of a number, which can divide that number. HCF, which is known as GCD (Greatest Common Divisor) also, is the highest value which can divide the given numbers.

Factors of 20: 1, 2, 4, 5, 10, 20.
Factors of 30: 1,2,3,5,6, 10, 15, 30.
So, 10 will be the HCF of 20 and 30.

Process to find out HCF  

  • Step 1 Factorise all the numbers into their prime factors.
  • Step 2 Collect all the common factors.
  • Step 3 Raise each factor to its minimum available power and multiply.

Example 1: HCF of 100, 200 and 250
Step 1 :100 = 2^2 X 5^2 ,200 = 2^3 X 5^2 ,250 = 2^1 x 5^3
Step 2 : 2,5
Step 3: 2^1 x 5^2 = 50

Alternatively, we can find HCF of 100,  200 and 250, by taking out common from these numbers. By writing these numbers as (100x + 200y + 250z), it can be very easily observed that 50 is common out of these numbers.

H.C.F. by Long Division Method

To find the H.C.F. of the given number we will follow the following steps:
1. Divide the larger one with shorter one
2. Divide again the remainder with the divisor and continue the process till it became zero
3. The last divisor is the H.C.F. of the number

Let’s take an example for this:

Example 4: Find the H.C.F. of 248 and 492?
To find the solution we will follow the following method

So the last divisor was 4 so the H.C.F of the given numbers is 4

Summarizing LCM and HCF in brief:
It is very essential to understand the mechanism of finding out LCM and HCF.  We can simply understand the mechanism to find out lowest common multiple and highest common factor through this example.

Example: Find out LCM and HCF of 16,12,24.
Solution:
The Multiples of each number:
16: 16,32,48,64, 80, 96, 112, 128….
12: 12, 24, 36, 48, 60, 72, 84, 96, 108..
4: 24,48,72,96, 120, 144, 168, 192…
Common Multiple: 48
Lowest Common Multiple: 48

Factors:
16: 1, 2, 4, 8, 16
12: 1, 2, 3, 4, 6, 12
24: 1, 2, 3, 4, 6, 8, 12, 24
Common Factor: 1, 2, 3, 4
Highest Common Factor: 4

Shortcuts for L.C.M
[list style="list5" color="black"]

  • When the Number N is divided by the numbers a, b, c and gives the same remained R in each case, then the number must be in the form of {p(l.c.m. of a,b,c,)+r}, where p is any positive integer.
  • When the number N is divided by the numbers a, b, c and gives p, q ,r when divided by N such that : (a-p)=(b-q)=(c-r)=Z, then the number N must be in the form of {f(l.c.m. of a,b,c,)- D} in each case, where f is any positive integer.
  • When the number N is divided by the three numbers a, b, c and they give remainders p, q ,r (the remainder is not same for the three numbers and the difference between the divisors and remainders is difference), in this case we identify the smallest number that satisfies these conditions (the smallest number which gives remainder p,q,r when divided by a,b, c and this number has be identified by assuming values one at a time). Once we have done that (let A be the smallest such number), the number must be in the form of: {p(l.c.m. of a,b,c,)+A} (A is the smallest number) and p may be any positive integer.
[/list]

Let’s use the above shortcuts in a few questions:

Example 1: Find the largest 4 digit number which gives 4 as a remainder when divided by 17 or 19?
Solution: We will solve the question with the following approach:
As per the given condition the number must be in the form of: {P(l.c.m. of a,b,c,)+r}
Now l.c.m. of 17 and 19 is 323 so the number must be in the form of i.e. {P(323)+4}
The largest value of P possible so that the number remains 4 digit is 30.
Therefore, 323P = 323X30 = 9690.
Therefore the number which when divided by 17 or 19 gives the remainder 4 is 9694

Example 2: Find the largest 4 digit number which gives the remainder 7 and 13 when divided by 11 and 17?

Solution:
Since the remainder are different, we first check the difference between the remainder and the divisor i.e. 11-7 =17-13=4
Since the difference is same, so we can use here our 2nd shortcut of LCM and the number must be in the form of {f(l.c.m. of a,b,c,)- D}
So now the LCM of 11 and 17 is 187, so the number must be in the form of 187f – 4
Now we have to find the value of f so the largest four digit number in the form of 187f id 187 x 53=9911 and the number which gives the remainder 7 and 13 when divided by 11 and 17 is 9907.

Example 3: Find the largest 3 digit number which gives the remainder 1 and 2 when divided by 3 and 5?
Solution:
This question is based on the third shortcut given above. Since the remainder is not the same when divided by the two numbers above and the difference between the remainders and the divisors is different as well, we use the following condition:
{p(l.c.m. of a,b,c,)+A} (A is the smallest number) and p may be any positive integer.

Let’s find the smallest such number first:
When N/3 ,the remainder is 3 i.e. the number will be in the form of (3h + 1) where h = 1 ,2,3,4….
Taking N= 3h+1
When this number N is divided by 5, the remainder is 2, so that means N-2 is clearly divisible by 5, that is (3h +1-2) is divisible by 5.

Let’s take values for h.
h =1
3 x 1 -1 = 2 not divisible by 5
h =2
3 x 2 -1= 5 is divisible by 5

So we have the smallest value for h as 2 and the smallest number as 7
Going by our formula=
N = {k(l.c.m. of a,b,,)+s.n.} where s.n.(smallest number)
So the number will be in the form of 15k + 7.
Now we have to find the largest 3 digit number in the form of 63k+59
Putting values for N, 66 x 15 + 7 = 997

Shortcuts for HCF:
There are two types of question usually asked in the examination based on H.C.F.
1. When  numbers a, b, c  is divided by N and gives the same remainder r.
2. When  numbers a, b, c  is divided by N and gives the different remainders p,q,r.

In the first method  let us assume the  numbers  a, b, c  is divided by N and gives the same remainder r each time then the H.C.F. is given by the H.C.F. of (a – b )or (b – a)
and (b-c) or (c – b) and (c –a)or (a –c).
Let’s have an example to understand it more clearly.

Example 1: When 59, 77,104 divided by N gives the same remainder in each case, then find the largest value of N possible?

Solution: Let us suppose the number N is the number which we have to find so:
Step 1: 59 = N x a +r………………………..1
77 = N x b +r………………………..2
104 = N x c +r………………………..3

Now subtract the equations we have (note that we will take only positive values)

Step 2: 77 – 59 = 18………………………….4
104 – 77 = 27………………………….5
104 – 59 = 45…………………………..6

Step 3: Now we can say that
18 = n x (b -a)
27 = n x (c – b)
45 = n x (c – a)

From this we can conclude that the N has to be the factor of 18 , 27 , 45
Now we are asked for the largest number for this so we will take the H.C.F. of 18 , 27, 45 and which is 9
So 9 is the largest number which divides 59 , 77 , 104 and gives 5 as the remainder .

When  numbers  a, b, c  is divided by N and gives the different remainder p,q,r.

Example 2:
Find the largest number N by which  when  162, 292, 325 are divided  gives 1, 5, 3 as remainders?

Solution:
Since the three numbers are 162 , 292 and 325 and the remainders are 1, 5, 3 so we can say that the number is totally divisible with 161 , 287 , 322, so we are looking for the largest number which divides these three so i.e. H.C.F of 161 , 287 , 322, is 7 so the 7 is the number which when divided by the 162,292,325 gives the remainder 1,5,3.

Some points to remember:
[list style="list5" color="black"]

  • LCM x HCF of two numbers is equal to the product of numbers
  • If HCF (H) of two numbers is given, then the numbers can be assume as HCF x A and HCF x B (A and B are integers)
  • HCF of a given set of numbers is always a factor of LCM
  • If H is the HCF of two numbers A and B, then H is also a factor of AX and BY, where X and Y are integers. In other words, H is also a factor of multiples of these numbers.
  • If HCF (A,B) is H, then H is also the HCF of (A) and (A+B)
  • If HCF (A,B) is H, then H is also the HCF of (A) and (A-B)
  • If HCF (A,B) is H, then H is also the HCF of (A+B) and (A-B)
  • If HCF=LCM for two numbers, then the numbers must be equal to each other.
  • If HCF of (A,B) = H, then H = HCF (A+B) and (A-B)
[/list]

LCM and HCF of Fractions:

LCM of two or more fractions is given by as a fraction:
(LCM of numerators of all the fractions) / (HCF of denominator of all the fractions)

HCF of two or more fractions is given by:
(HCF of numerators of all the fractions) / (LCM of denominator of all the fractions)

QUESTIONS BASED ON THE CONCEPT OF LCM AND HCF

Example 1:  Ram can do a work in 10 days and Sham can do the same work in 12 days. How many days will it take if both of them start working together?

Solution:
Let us assume total work = LCM of (10, 12) units = 60 units. Now since 60 units of work is being done by Ram in 10 days, so Ram  is doing 6 units of  work per day and similarly, Sham  is doing 5 units of  work per day. Hence, t-together they are doing 11 units of  work in one day. So, finally they will take 11 = 511 days to complete the work.

Example 2: There are two bells in a temple. Both the bells toll at a regular interval of 20sec and 50 sec respectively. After how much time will they toll together for the first time?  

Solution:
Time taken by the 1st bell to toll = 66.66  Time taken by the 2nd bell to toll = 50
LCM (20,50) of the two = 100
Hence, the first time they toll together: 100 seconds.

Example 3: There are 24 peaches, 36 apricots and 60  bananas and they have to be arranged in several rows in  such a way that every row contains the same number of  fruits of one type. What is the minimum number of rows required for this to happen?

Solution:
We can put one fruit in one row, and in (24  + 36 + 60) 120 rows, we can arrange all the fruits. Or, we can put two fruits in one row and can arrange all the fruits in 60 rows. But for the rows to be minimum, the number of fruits should be maximum in one row.  HCF of 24, 36, 60 = 12, so 12 fruits should be there in one row.  Hence, the number of rows = 10

Example 4: There is a number which when divided by 4 and 5 gives 3 as the remainder. What is the lowest three-digit number which satisfy this condition?

Solution:
Let us assume that there is no remainder. So,  the number has to be a multiple of LCM of 4 and 5. Now,  LCM (4, 5) = 20 But there is a remainder of 3 when divided by 4 and  5. So, the number will be of the form (20N + 3).  Hence, the numbers are 23, 43, 63, 83, 103 and so  on …  So, 103 is the answer.