Find the greatest number that will divide and leaving remainder and respectively.
Step 1 Subtract the remainders that are and from the given numbers and respectively :
Step 2 Finding highest common factor of the numbers obtained in step 1 ( by subtracting the remainder from the given numbers) that are and :
Highest common factor of and (by prime factorisation method ) :
So Highest common factor of and ( multiplying the common prime factors to get highest common factors )
Since the greatest number that will divide and leaving the remainder and is highest common factor of and
Therefore Greatest number that will divide and leaving remainder and respectively is