Home
Class 10
MATHS
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.

Text Solution

AI Generated Solution

To find the largest number that divides 1251, 9377, and 15628 leaving remainders 1, 2, and 3 respectively, we can follow these steps: ### Step-by-step Solution: 1. **Subtract the Remainders**: - For 1251, subtract 1: \[ 1251 - 1 = 1250 ...
Promotional Banner

Topper's Solved these Questions

  • REAL NUMBERS

    NCERT EXEMPLAR ENGLISH|Exercise LONG ANSWER TYPE QUESTIONS|5 Videos

  • REAL NUMBERS

    NCERT EXEMPLAR ENGLISH|Exercise VERY SHORT ANSWER TYPE QUESTIONS|10 Videos

  • QUADRIATIC EQUATIONS

    NCERT EXEMPLAR ENGLISH|Exercise LONG ANSWER TYPE|12 Videos

  • STATISTICS AND PROBABILITY

    NCERT EXEMPLAR ENGLISH|Exercise LONG ASWERS QUESTIONS|14 Videos

Similar Questions

Explore conceptually related problems

What is the largest number that divides 626, 3127 and 15628 and leaves remainders of 1,2 and 3 respectively?

What is the largest number that divides 626, 3127 and 15628 and leaves remainders of 1,2 and 3 respectively?

Find the largest number that will divide 398, 436 and 542 leaving remainders 7, 11 and 15 respectively.

Find the largest number that will divide 398 , 436 and 542 leaving remainders 7 , 11 and 15 respectively.

Find the largest number that will divide 398, 436 and 542 leaving remainders 7,11 and 15 respectively.

Find the largest number that divides 280 and 1248 leaving remainders 4 and 6 respectively.

Find the greatest number that will divide 445, 572 and 699 leaving remainders 4,5 and 6 respectively.

Find the largest number that will divide 546,437 , and 400 leaving remainders 19 ,12 ,and 9 respecting.

Find the largest number that divides 189 and 249 leaving remainder 9 in each case .

Find the largest number that divides 76, 115 and 154 leaving remainder 11 in each case