Math, asked by rina94711, 2 months ago

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

Answers

Answered by nishantbhaskar827

1

Answer:

625

Step-by-step explanation:

find hcf using Euclid algorithm of(1251-1,9377-2,15628-3)=hcf(hcf(1250,9375), 15625)=625.

Previous Question

Next Question

Similar questions

Math, 30 days ago

EXERCISE 1. A rectangular park is 35 m long and 20 m wide. A path 2 m wide is constructed outside the pat Find the area of the path. 2. 5 m wide path is built inside a rectangular field of size 550 m × 360 m. Find the area of the path...

English, 30 days ago

Define apocalyptic define apocalyptic...

History, 30 days ago

write the full form of TISCO...

English, 2 months ago

She arrived to work on time Phrases or clauses...

Math, 2 months ago

10xa + 25x -6a - 15 factorise...

Math, 9 months ago

A. 548 ÷____= 548 B. (-732) ÷____=1 C. 1-562) ÷____= not defined D. 0 ÷___= 0 E. 999 ÷___= (-999) F. 20 ÷___= 2 its urgent..

English, 9 months ago

why does the author insist upon studying the nature...

English, 9 months ago

part of /a very / our life/ patience/ important/ is...