Using Euclid's division algorithm,find the la | vedclass

Name: Exam Paper Generator | JEE NEET Paper Generator | Vedclass
Brand: Vedclass
Rating: 5 (35 reviews)

Question

(A) Since $1, 2$ and $3$ are the remainders of $1251, 9377$ and $15628$ respectively,we subtract these remainders from the numbers to get numbers that

Vedclass · Accepted Answer

$625$

Vedclass · Answer

(A) Since $1, 2$ and $3$ are the remainders of $1251, 9377$ and $15628$ respectively,we subtract these remainders from the numbers to get numbers that are exactly divisible by the required number.$1251 - 1 = 1250$$9377 - 2 = 9375$$15628 - 3 = 15625$The required number is the $HCF$ of $1250, 9375$ and $15625$.Using Euclid's division algorithm,$a = bq + r$:First,find $HCF$ of $15625$ and $9375$:$15625 = 9375 	imes 1 + 6250$$9375 = 6250 	imes 1 + 3125$$6250 = 3125 	imes 2 + 0$So,$HCF(15625, 9375) = 3125$.Now,find $HCF$ of $3125$ and $1250$:$3125 = 1250 	imes 2 + 625$$1250 = 625 	imes 2 + 0$So,$HCF(3125, 1250) = 625$.Thus,the largest number that divides $1251, 9377$ and $15628$ leaving remainders $1, 2$ and $3$ respectively is $625$.

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

Similar Questions

If the Least Common Multiple $(LCM)$ of two numbers is equal to their product,then their Greatest Common Divisor $(GCD)$ is ........ .

Find the $G$.$C$.$D$. of $(28, 35, 91)$.

Two brands of chocolates are available in packs of $24$ and $15$ respectively. If one needs to buy an equal number of chocolates of both kinds,what is the least number of boxes of each kind would one need to buy?

The Least Common Multiple $(LCM)$ of the smallest prime number and the smallest composite number is ..........

If $HCF(p, q) = p$,then $LCM(p, q)$ is equal to . . . . . . .

Vedclass Test Series

Exam Paper Generator

Online Exam Module