Math, asked by mehtapari1983, 10 months ago

Using Euclid's division algorithm, find the largest
number that divides 1251, 9377 and 15628
leaving remainders 1, 2 and 3 respectively.
[Hint: Find HCF of 1250, 9375 and 15625.)

,maths std 10
pls its urgent

Answers

Answered by veekvjy

1

Answer:

Heyy your question is answered in the attached pic.

Hope this helps

Attachments:

Previous Question

Next Question

Similar questions

Math, 5 months ago

factorization of 81y²-36y+4 using identities ...

Physics, 5 months ago

A spring is 6 cm long when it is unstretched but is stretched to 9 cm when a mass is hung from it. What is the extension of the spring?

Science, 5 months ago

*परागकणों का परागकोष से पुष्प के वर्तिकाग्र पर स्थानांतरण क्या कहलाता है?* 1️⃣ विखंडन 2️⃣ परागण 3️⃣ बीजाणु निर्माण 4️⃣ निषेचन...

English, 10 months ago

2 A group of children decide to explore a new deserted house on a hill top- reach there - find no one- suddenly hear someone groaning- discover a young boy tied to a chair-release him- discover that the house is a hideout for terrorists- inform police- terrorists are nabbed when they return- children rewarded for their bravery.

Social Sciences, 10 months ago

steps of Indian government towards protection and awarenessof environment...

Math, 1 year ago

Find the HCF multiple LCM of 100 and 900...

Environmental Sciences, 1 year ago

Hi how to stop air pollution...

English, 1 year ago

He said,' have faith in god'.