Using Euclid’s division algorithm, find ...

Using Euclid’s division algorithm, find the largest number that divides 1251, 9377 and 15628 leaving remainders 1, 2 and 3 respectively.

Verified by Experts

The correct Answer is:

625

REAL NUMBERS
KUMAR PRAKASHAN|Exercise OBJECTIVE QUESTIONS|28 Videos
QUESTION PAPER-2
KUMAR PRAKASHAN|Exercise Section C|14 Videos
SOME AAPLICATIONS OF TRIGONOMETRY
KUMAR PRAKASHAN|Exercise Objective Questions|24 Videos

Similar Questions

Explore conceptually related problems

Find the greatest number which divides 450, 570 and 880 leaving remainders 2, 3 and 5 respectively.

The largest number which divides 70 and 125 leaving remainders 5 and 8 respectively is ...........

Using Euclid’s division algorithm, find the HCF of 5404 and 4800

Using Euclid’s division algorithm, find the HCF of 441, 567 and 693.

Using Euclid’s division algorithm, find the HCF of 1620, 1725 and 255.

Use Euclid’s algorithm to find the HCF of 4052 and 12576.

Use Euclid’s division algorithm to find the gt HCF of ( 1 ) 135 and 225 ( 2 ) 196 and 382 2 0 ( 3 ) 867 and 255.

Find the sum of all two digit numbers which when divided by 4, yields 1 as remainder.

Using binomial theorem. Prove that 6^n -5n always leaves remainder 1 when divided by 25.

Find the HCF of 660 and 252 by using Euclid’s division algorithm and verify it by using prime factorisation m ethod.