answersLogoWhite

0


Best Answer

divident/divisor = quotient remainder...

divident/18 = 48 remainder 6.

divident = (18)(48) + 6

divident = 870

Check:

870/18 = 48.33333333

.33333333 is not the remainder

48 x 18 = 864

870 - 864 = 6

User Avatar

Wiki User

โˆ™ 2009-09-17 00:08:32
This answer is:
๐Ÿ™
0
๐Ÿคจ
0
๐Ÿ˜ฎ
0
User Avatar
Study guides
๐Ÿ““
See all Study Guides
โœ๏ธ
Create a Study Guide

Add your answer:

Earn +20 pts
Q: The divisor is 18 the quotient is 48 the remainder is 6 What is the dividend?
Write your answer...
Submit
Related questions

What is the quotient if the dividend is 12 and the divisor is 18?

If the dividend is 18 and the divisor is 1.5 What is the quotient


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


How use multiplication to check the answer to a division problem?

Dividend divided by divisor equals quotient. If you multiply the quotient by the divisor, you should get the dividend. 18/9 = 2 2 x 9 = 18 Just reverse your steps.


If you have 18 erasers and use 3 erasers each month. how many months will your eraser last identify the quotient dividendand divisor.?

Divide 18 by 3 The dividend is 18 The divisor is 3 The answer is the quotient


Which would be a divisor 0.15 or 0.12?

Being a divisor isn't an inherent property of a number. Rather, whether or not a number serves as a divisor depends on how a fraction is formulated. For example, in the fraction 18/6, 18 is the dividend, or the number being divided, 6 is the divisor, or the number the dividend is being divided by, and 3 is the quotient, or the result of the division.


Using the C or similar programming languages how can I find the greatest common denominator of two integers?

The easiest way to find the greatest common denominator of two integers with a computer program is to use the Euclidean algorithm. Of the most popular methods of finding the GCD of two numbers, the Euclidean algorithm does it with the least amount of work and requires the least amount of code.In order to understand the Euclidean algorithm, you'll need to know a few division terms:The dividend is the number to be divided.The divisor is the number being divided by.The quotient is the number of times the divisor divides into the dividend.The remainder is the amount "left over" when the divisor cannot go into the dividend an integral number of times.18A divided by 12B gives a quotient of 1C and a remainder of 6D. A is the dividend, B is the divisor, C is the quotient, and D is the remainder.The Euclidean algorithm works like this:Check if either of the two integers is 0. If so, there is no solution (Ø), as a number cannot share a GCD with zero. Besides, division by zero is a big no-no.Check if either of the two integers is 1. If so, 1 is the GCD.Divide the larger of the two integers by the smaller.Divide the divisor of the previous division operation by the remainder of the previous operation.Repeat step four until the remainder equals zero. When the remainder equals zero, the divisor of the last operation is the GCD.If you still don't get it, try looking at the Euclidean algorithm in action:Find the GCD of 84 and 18.Check to see if either 84 or 18 is equal to 0. Nope. Continue on...Check to see if either 84 or 18 is equal to 1. Nope. Continue on...Since 84 is larger than 18, divide 84 by 18. Quotient is 4, remainder is 12.Take the divisor of the last operation (18) and divide it by the remainder of the last operation (12). Quotient is 1, remainder is 6.Take the divisor of the last operation (12) and divide it by the remainder of the last operation (6). Quotient is 2, remainder is 0.When the remainder is 0, the divisor of the last operation is the GCD. So the GCD in this case is 6.You should now have a good grasp of how the Euclidean algorithm works. Now we need to turn it into code. We'll need three variables, all of them integers:int divisor, dividend, remainder;The purpose of the variables is self-explanatory. Next, we need to make a few decisions. We need to decide if the dividend or the divisor is 0. If that test is passed, then we need to decide if the dividend or the divisor is 1. If that test is passed, then we need make sure that dividend is larger than divisor.if(dividend 1) {printf("The GCD is 1.\n");}// Make sure the dividend is greater than the divisor.if(divisor > dividend) {remainder = dividend;dividend = divisor;divisor = remainder;}// Calculate the GCD.while(remainder != 0) {remainder = dividend % divisor;dividend = divisor;divisor = remainder;}// Display the answer to the user.printf("The GCD is %i.\n", dividend);}And the GCD lived happily ever after. The end.


If the divisor is six and the qoutient is three then what is the dividend?

The dividend is 18 because 18/6 = 3


The Divisor is 6 the quoitent is 3 What is the dividend?

18


How do you change an impropper fraction to a mixed decimal?

Change 6/5 to a mixed number.1. Divide the numerator by the denominator: 6 ÷ 5 = (quotient) 1 (remainder) 12. Write the mixed number: (quotient) 1 1/5 (remainder/divisor)Change 18/7 to a mixed number.1. Divide the numerator by the denominator: 18 ÷ 7 = (quotient) 2 (remainder) 42. Write the mixed number: (quotient) 2 4/7 (remainder/divisor)


What is the quotient and remainder of 18 and 872?

872 divided by 18 is 48 with remainder 8.


What is the quotient and remainder of 18 and 885?

885 divided by 18 is 49 with remainder 3


How is 6 a divisor of 18?

6 divides evenly into 18 with no remainder.


Why is 376.0 divided by 93's quotient bigger than 376 divided by 93.01's quotient?

It's easier to visualize with smaller numbers. 18 divided by 3 = 6 18 divided by 6 = 3 If the dividend is the same, the smaller the divisor, the larger the quotient.


What is the quotient and remainder of 500 divided by 18?

27.7778


What is 17 divided by 18 with a remainder?

0.9444


What is the remainder and answer of 120 divided by 18?

6.6667


Which is the remainder for the quotient of 124 and 18?

124 / 18 = 6 r16


Is 18 a divisor of 6 why or why not?

No, because 18 does not divide into 6 without any remainder.


What number when divided by 43 gives a quotient of 18 and a remainder of 27?

447


What is 56 divied by 3?

The quotient is 18 with a remainder of 2


What are the details of remainder theorem?

Remainder Theorem:- When f(x) is divided by (x-a) the remainder is f(a) Tor example:- f(x) x3-2x2+5x+8 divided by x-2 f(2) 8-8+10+8 = 18 So the remainder is 18 if there is no remainder then the divisor is a factor of the dividend.


What is the quotient and remainder when 75 is divided by 19?

3.9474


What are the quotient and remainder when 75 is divided by 19?

3.9474


What is 2902 divided by 18 with a remainder?

161.2222


What is 212 divided by 18 with remainder?

11.7778