Want this question answered?

Q: When dividing 878 by 31 a student finds a quotient of 28 remainder 11 what did she do wrong?

Write your answer...

Submit

Still have questions?

Continue Learning about Math & Arithmetic

The modulo (shortened to mod) finds the remainder of the division, while the div function finds integer division. Therefore, because 10 / 3 is equal to 3 remainder 1, 10 mod 3 is equal to 1, the remainder of the sum. In some programming languages this is written as %, for example, in Java or C the result of 10 % 3 would be 1.

Of 1131 pennies, x weigh 3.09 g and y weigh 2.51 g. In total, the 1131 pennies weigh 3001.8 g. 3.09x + 2.51y 1131 = 3001.8 I have no idea what to do after that, or if it's even right. I was thinking maybe dividing, but the number was so small it had to be wrong. Tell me, what grade is this for?

This isn't done by an equation. Start dividing 100 / 7. Since this won't give you an integer, round the result up. Now multiply this result by 7, to get a multiple of 7. Add 7 to the result, then add 7 again, and again, until you get over 200.

In the New International Version there are 3 - all are in Proverbs:Proverbs 8:35 NIVFor whoever finds me finds life and receives favorfrom the LORDProverbs 12:2 NIVA good man obtains favor from theLORD, but the LORD condemns a crafty manProverbs 18:22 NIVHe who finds a wife finds what is good and receives favorfrom the LORD

After a fire, the owl easily finds food in open areas.

Related questions

6. 6 % 5 = 1, where % is the modulo operator (a fancy way of saying that it finds the remainder). If you were instead dividing by 8 and not 5, then the answer would be 9.

The modulo (shortened to mod) finds the remainder of the division, while the div function finds integer division. Therefore, because 10 / 3 is equal to 3 remainder 1, 10 mod 3 is equal to 1, the remainder of the sum. In some programming languages this is written as %, for example, in Java or C the result of 10 % 3 would be 1.

The MOD function finds a modulus. That is the remainder when you divide one number into another. So if you divide 10 by 3, you would get a remainder of 1. To do that with the MOD function, you enter it as: =MOD(10,3)

You will have to pay the remainder of your lease. Or even have to pay until the landlord finds someone else to rent to.

A student with a 1.4GPA can do a lot because the knowledge the student might have the knowledge but finds it difficult to put it down in writing. So i will suggest that every student should be given that chance to prove his or her self because the practical is different from the theory. So i say a student with a 1.4GPA can do a whole much more than a student with 3GPA.

A modulo function finds the remainder term when you divide one number by another number. For example, if you divide 20 by 3 you're left with a remainder term of 2. So 20 mod 3 = 2. If you divide 21 by 3 you're left with no remainder term. So 21 mod 3 = 0.

University wont be easy for many people, your proffesers will be very hard on you but if you keep your work above your personal life you'll do great. Good Luck !!!:P

Whatever volume contains that article. Which volume number that is will depend on the particular encyclopedia.

1200 g

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.

One way for high school students to ensure they will receive scholarships upon graduation is by researching service scholarships. A student should compile a list of service scholarships and their areas of volunteer work. If a student finds a majority of scholarships focus on serving in soup kitchens, then a student should try to do this as much as possible in high school.

If you are referring to the Even and Odd functions, you can just start typing then or find them through the Math and Trig functions category. You can use the Insert Function button on the Formula Bar to do that. You can also do it through menus or tabs, depending on the version of Excel you have. To find out if an actual value is odd or even you could use the MOD function, which finds a remainder. If you divide by 2 and the remainder is 1 it is obviously odd, and if it is 0 then it is even. You use the MOD function like this, where the 2 is dividing into the first value, in this case 10: =MOD(10,2) It could also be used with a cell reference, like this, where it is using A15 as an example: =MOD(A15,2)