Find the greatest number of digits which on dividing by , and leaves in each case as the remainder.
First, we will find the greatest number of digits that is divided completely by each and
If the number is divided by , and , it must be divided by their L.C.M. also.
L.C.M. of and
L.C.M. =
=
The greatest number of digits which is completely divisible by and must be a multiple of
To find the greatest number of digits we follow the long division method
The digit greatest number which is completely divisible by or with and =
We want the that gives remainder 3 in each case i.e. =
So, the number is