Best Answer

The divisor is 9.

quotient x divisor + remainder = dividend

⇒ quotient x divisor = dividend - remainder

⇒ divisor = (dividend - remainder) ÷ quotient

= (53 - 8) ÷ 5

= 45 ÷ 5

= 9

Q: What is the divisor when the dividend is 53 and the quotient is 5 with a remainder of 8?

Write your answer...

Submit

Still have questions?

Continue Learning about Other Math

There are two main methods:Euclid's methodChoose one of the numbers to be the dividend of a division and the other to be the divisor.Perform the divisionIgnore the quotient and keep the remainderIf the remainder is zero, the last divisor is the GCDReplace the dividend by the divisorReplace the divisor by the last remainderRepeat from step 2.It doesn't matter which number is the dividend and which is the divisor of the first division, but if the larger is chosen as the divisor, the first run through the steps above will swap the two over so that the larger becomes the dividend and the smaller the divisor - it is better to choose the larger as the dividend in the first place. Prime factorisationExpress the numbers in their prime factorisations in power format. Multiply the common primes to their lowest power together to get the GCD.The first is limited to two numbers, but the latter can be used to find the gcd of any number of numbers.Examples:GCD of 500 and 240:Euclid's method:500 ÷ 240 = 2 r 20 240 ÷ 20 = 6 r 0gcd = 20Prime factorisation:500 = 22 x 53 240 = 24 x 3 x 5gcd = 22 x 5 = 20

480 is divisible by 9 but not evenly. When you divide 480 by 9 you get a quotient of 53 and a remainder of 3

2173/53 = 41

53 divided by 7 is 7 with remainder 4

53

Related questions

53

There are two main methods:Euclid's methodChoose one of the numbers to be the dividend of a division and the other to be the divisor.Perform the divisionIgnore the quotient and keep the remainderIf the remainder is zero, the last divisor is the GCDReplace the dividend by the divisorReplace the divisor by the last remainderRepeat from step 2.It doesn't matter which number is the dividend and which is the divisor of the first division, but if the larger is chosen as the divisor, the first run through the steps above will swap the two over so that the larger becomes the dividend and the smaller the divisor - it is better to choose the larger as the dividend in the first place. Prime factorisationExpress the numbers in their prime factorisations in power format. Multiply the common primes to their lowest power together to get the GCD.The first is limited to two numbers, but the latter can be used to find the gcd of any number of numbers.Examples:GCD of 500 and 240:Euclid's method:500 ÷ 240 = 2 r 20 240 ÷ 20 = 6 r 0gcd = 20Prime factorisation:500 = 22 x 53 240 = 24 x 3 x 5gcd = 22 x 5 = 20

480 is divisible by 9 but not evenly. When you divide 480 by 9 you get a quotient of 53 and a remainder of 3

2173/53 = 41

53 divided by 7 is 7 with remainder 4

53

Yes. The quotient is 53 .

53.5269

7.0837

14.1509

3.3557

53.5714