0
Add your answer:
Earn +20 pts
What is the greatest common divisor of 132 and 24?
The GCF is 12.
How many times does 4 go into 49?
12, with one remainder.12.25 times or 12 times with a remainder of 1.
What is the possible biggest remainder when you divide any number by 12?
Eleven.
When you divide by 3 can there be a remainder of 5?
No. The remainder after any division must be less than the divisor: it can be any of the numbers 0 to the divisor less 1. For three: 3 - 1 = 2, so the possible remainders are: 0, 1, 2 Division is the opposite of multiplication in that it tells you how many times the divisor can be subtracted from the dividend to get to 0 without going past 0; if there is a remainder, it tells you that you that a fraction of the divisor needs to be subtracted to get to 0. eg 12 ÷ 3 = 4 says that you can subtract 3 from 12 four times and you will get 0: 12 - 3 (once) = 9, 9 - 3 (twice) = 6, 6 - 3 (three times) = 3, 3 - 3 = 0 (four times). eg 11 ÷ 3 = 3 remainder 2 says that you can subtract 3 from 11 three times but if you subtract it four times you will go past 0: 11 - 3 (once) = 8, 8 - 3 (twice) = 5, 5 - 3 (three times) = 2; but 2 - 3 = -1 which is past zero, so there is a remainder of 2 which requires a fraction, in this case two thirds of 3, to get to (exactly) zero: 2 - 2/3 x 3 = 2 - 2 = 0. If you have a remainder larger than the divisor, you can subtract the divisor again and still not reach 0 (as in the "once", "twice" and "three times" of the examples above).
If the quotient of x and 12 is 4 what is the divisor?
The divisor is 3 because 12/3 = 4
What is the greatest remaidner when you divide by 12?
The greatest possible remainder is 11.
What is the greatest common factor of 25 and 63?
Why not use the Euclidean Algorithm and find out? Divide 63 by 25, and you get a remainder of 13. (The quotient is not important.) Now the divisor of the last division problem becomes the dividend, and the remainder becomes the divisor - that is, we divide 25 by 13 this time. We get a remainder of 12. Divide 13 by 12, and you get a remainder of 1. Divide 12 by 1, you get no remainder. Therefore, this last divisor, 1, is the greatest common factor (or divisor) of the original two numbers. (As a side note, because the gcf is 1, that means those two numbers are what's called relatively prime.)
What is 12 remainder 12 as a fraction?
The answer depends on what the divisor is.
What is the greatest common divisor of 12 and 40?
The Greatest Common Divisor is 4
What is the greatest common divisor for 21 and 12?
The Greatest Common Divisor (GCD) for 21 12 is 3.
What is the greatest common divisor of 12 and 3?
The Greatest Common Divisor (GCD) for 12 3 is 3.
What is the greatest common divisor of 12 and 20?
Greatest Common Divisor (GCD) for 12 20 is 4.
What is 12 and 28's greatest common divisor?
The Greatest Common Divisor of 12, 28 is 4.
What is the greatest common divisor of 11 and 12?
The Greatest Common Divisor (GCD) for 11 12 is 1.
What is the largest possible remainder for a math problem with 2 for a divisor?
1. The divisor is the second number in a division problem. For instance 6 / 3 = 2. In this example, the divisor is 3. If you have a divisor of X, then the largest remainder possible is X-1. This is because if you had one more number in the remainder, it would form a complete count, and the remainder would go away. In the case of 2 as your divisor, think of the number 11. 11 / 2 has a remainder of 1. However, if you had one more in the remainder, you'd have 2, and that would be a complete division. (Also, the number you have to be 12.) And there would be no remainder.
The greatest common divisor of 12 and 15?
Greatest common divisor of 12 and 15 is 3.
What is the greatest common divisor of 12 36 and 42?
The Greatest Common Divisor (GCD) for 12 36 42 is 6.
