Study guides

Q: What is the greatest possible remainder if the divisor is 12?

Write your answer...

Submit

Related questions

The greatest possible remainder is 11.

The answer depends on what the divisor is.

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.)

The Greatest Common Divisor of 12, 15 is 3.

The Greatest Common Divisor (GCD) for 12 72 96 is 12

The Greatest Common Divisor of 12, 28 is 4.

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 is 4

The Greatest Common Divisor is 4

The Greatest Common Divisor is 4

Greatest common divisor of 12 and 15 is 3.

The Greatest Common Divisor (GCD) for 21 12 is 3.

The Greatest Common Divisor (GCD) for 11 12 is 1.

Greatest Common Divisor (GCD) for 12 20 is 4.

The Greatest Common Divisor (GCD) for 12 3 is 3.

The Greatest Common Divisor is 2

The GCF is 12.

The Greatest Common Divisor (GCD) for 12 125 200 is 1.

The Greatest Common Divisor (GCD) for 12 36 42 is 6.

They very definitely are not! You cannot have a remainder that is larger than the divisor. Furthermore, division by 6 cannot leave a remainder of 12 since 12 is divisible by 6!

The Greatest Common Divisor of 24, 36, 60 is 12.

gcd(12, 48) = 12.

The answer is 3

It is: 12

12.

People also asked