answersLogoWhite

0


Best Answer

The smallest number (greater than 9) that when divided by 9 would leave a remainder of 3 is 12. The next would be 21 and the next 30. Notice the pattern here, how each number (12, 21, 30) is 9 apart (since we are dividing each by 9).

For 12, the smallest is 15 followed by 27, then 39 and so on.

For 21: 24, 45, 66...

So we list them until we have one that is on all 3 lists:

9: 12, 21, 30, 39, 48, 57, 66, 75, 84, 93, 102, 111, 120, 129, 138, 147, 156, 165, 174, 183, 192, 201, 210, 219, 228, 237, 246, 255, 264, 273, 282, 291

12: 15, 27, 39, 51, 63, 75, 87, 99, 111, 123, 135, 147, 159, 171, 183, 195, 207, 219, 231, 243, 255, 267, 279, 291

21: 24, 45, 66, 87, 108, 129, 150, 171, 192, 213, 234, 255, 276, 297

The first number on all three lists is 255, so this is the smallest number into which 9, 12, and 21 can go into and in each case leave a remainder of 3.

User Avatar

Wiki User

14y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is the least number into which 9 12 and 21 can go into and in each case leave a remainder of 3?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is the largest number which when divided into 143 and 199 will leave a remainder in each case?

Any number greater than 199 will divide into both zero times and leave a remainder (of the original number); there is no upper limit to the numbers greater than 199. -------------------------------- The largest number to divide into both and leave the SAME remainder is 56 (leaving a remainder of 31 in both cases).


If a three-digit number is divided by 5 or by 6 the remainder is 1 in each case what is the least such three-digit number?

121


What is the largest number which when divided into 163 and 237 will leave remainder of 15 in each case?

There is no such number. You can have arbitrarily large numbers with this property - therefore there is no largest.


What is the least common divisor of 10 and 45?

The divisor of a number is a number which divides into that number. The least divisor of any number 1, so the least common divisor of 10 and 45 is also 1. Perhaps you meant "Least Common Multiple" (the smallest positive number which 10 and 45 divide without remainder) in which case LCM(10, 45) = 90 Or you meant "Highest Common Factor" (the largest positive number which divides into both 10 and 45 without remainder) in which case HCF(10, 45) = 5.


What is the greatest number that divides 364 414 and 539 with the same remainder in each case?

The number is 25.


Is quotient known as remainder?

No. When you divide a number by another number, let's say 26/4, you can't always get a perfect number. In this case, 6*4 is 24, and you have 2 "remainder", or 2 left over. The quotient is the whole answer, in this case 6 remainder 2. So the remainder is part of the quotient, but not the whole quotient itself.


What is the greatest integer that can divide each of the numbers 283 427 and 715 to leave the same remainder in each case?

72.


Find the greatest number which divides 742 and 1162 leaving 7 as remainder in each case?

742/105 = 7 remainder 7 1162/105 = 11 remainder 7


A number 289811222 gives a reminder and 2 when divided by 12345 which of the followed number would give Reminder 0 when divided by -12345?

First, the word is remainder, not reminder.In any case, none of the followed numbers would give a remainder of 2 since there are no such numbers!First, the word is remainder, not reminder.In any case, none of the followed numbers would give a remainder of 2 since there are no such numbers!First, the word is remainder, not reminder.In any case, none of the followed numbers would give a remainder of 2 since there are no such numbers!First, the word is remainder, not reminder.In any case, none of the followed numbers would give a remainder of 2 since there are no such numbers!


What least number must be subtracted from 1294 so that the remainder when divided by 9 11 and 13 will leave in each case the same remainder 6?

The smallest number that can be subtracted from 1294, yielding a result that when divided by 9, 11, and 13 leaves a remainder of 6 is 1. To prove this, run the following snippit of a program int i; for (i=1294; i!= 0; i--) if (i % 9 6) break; printf("%u", 1294-i); another way to prove it it to multiply 9 11 and 13, yielding 1287, adding six, yielding 1293, which is one away from 1294.


What is the greatest number which divides 279 and 233 leaving 3 as remainder in each case?

46.


The quotient 18 is 5find the number?

You can use the equation: quotient x divisor = dividend In case there is a remainder, the formula is: quitient x divisor + remainder = dividend