Find the greatest number that will divide and leaving a remainder in each case.
Subtracting remainder from the given numbers.
Firstly, we have to subtract the remainder from each number, so that each number is exactly divisible by the greatest number.
Finding the H.C.F of and .
Prime factorisation of .
Prime factorisation of .
Prime factorisation of .
H.C.F of and .
Hence, the answer of this question is .