0
Still curious? Ask our experts.
Chat with our AI personalities
Ezra
Jordan
ProfessorAdd your answer:
Earn +20 pts
How do you divide two numbers without division operator?
int dividend,divisor,remainder; int division(int p,int q){ int quotient=1; /*if divisor and diviend are equal then quotient=1*/ if(p==q){ remainder=0; return 1; } /*if dividend is smaller than divisor then remainder=dividend*/ if(p<q){ remainder=p; return 0; } /*shift left till divisor > dividend*/ while(p>=q){ q<<=1; quotient<<=1; } /*shift right for one time so that divisor become smaller than dividend*/ q>>=1; quotient>>=1; /*again call division recurcively*/ quotient+=division(p-q,divisor); return quotient; } int main(){ cout<<"\nEnter dividend:"; cin>>dividend; cout<<"\nEnter divisor:"; cin>>divisor; cout<<"\nQuotient:"<<division(dividend,divisor); cout<<"\nRemainder:"<<remainder; //system("pause"); return 0; }
What is 875 divided by 7?
125
In algebra what does x equal?
i don't know what the problem is so um here are some examples i guessMULTIPLICATION5xX=20In this problem X=45x4=20SUBTRACTION80-X=43In this problem X=3780-37=43ADDITION5+X=98In this problem X=935+93=98Sorry i cant do the division example but i don't have a division signhope this will help youNinjainon123 out
What is 279 divided by 9?
31
Is multiplication before division in order of operations?
"Parentheses, Exponents, Multiplication and Division, and Addition and Subtraction." Therefore multiplication and division are equal.
How do you check the answer of a division problem?
To check the answer of a division problem, you can multiply the quotient (the result of the division) by the divisor (the number you divided by) and add the remainder (if any) to the product. The result should equal the dividend (the number you divided into). This process ensures that the division was done correctly and that the answer is accurate.
In division problem the number being divided is called?
The number being divided is the dividend, which is being divided by the divisor to equal the quotient. (dividend) ÷ (divisor) = (quotient)
How do you check the quotient from a divisor problem?
you use multiply the divisor times the quotient & it should equal the dividend.
Why must the remainder be less than the divisor?
The remainder is less than the divisor because if the remainder was greater than the divisor, you have the wrong quotient. In other words, you should increase your quotient until your remainder is less than your divisor!
Why is two hundred ninety six divided by six equal forty eight reminder eight incorrect?
Because the remainder from a division must be smaller than the divisor. The remainder, 8, is not smaller than the divisor, 6.
What division problem equal 262?
524 divided by 2 = 262
Does it matter in a division problem that the remainder is more than the divisor?
Yes, it matters. Division is usually defined in such a way that the remainder must be less than the divisor. Let's look at a simple example. You want to divide 5 apples between 2 people. You might say that the answer is 1, with a remainder of 3; but that means that there are still apples to share (without cutting them into fractional parts). The answer 2, with a remainder of 1, more accurately reflects the fact that you can each person, in this example, can have two whole apples. In general, if the remainder is greater than (or equal to) the divisor, it's an indication that the division was not done correctly.
What is 810 divided by 5?
0.0062
How do you divide two numbers without division operator?
int dividend,divisor,remainder; int division(int p,int q){ int quotient=1; /*if divisor and diviend are equal then quotient=1*/ if(p==q){ remainder=0; return 1; } /*if dividend is smaller than divisor then remainder=dividend*/ if(p<q){ remainder=p; return 0; } /*shift left till divisor > dividend*/ while(p>=q){ q<<=1; quotient<<=1; } /*shift right for one time so that divisor become smaller than dividend*/ q>>=1; quotient>>=1; /*again call division recurcively*/ quotient+=division(p-q,divisor); return quotient; } int main(){ cout<<"\nEnter dividend:"; cin>>dividend; cout<<"\nEnter divisor:"; cin>>divisor; cout<<"\nQuotient:"<<division(dividend,divisor); cout<<"\nRemainder:"<<remainder; //system("pause"); return 0; }
What is the question for a division problem?
Be more specific. It actually depends what your division problem is. Example: the question for 16 and 4 would be, "What does 16 divided by 4 equal?" Answer your question?
Why can't the remainder be equal to the divisor?
It might help to think of a division (with remainder) as "evenly distributing" some items - for example, give the same number of apples to each person. The "remainder" is whatever is LESS than the number of people (the divisor), so you can't continue distributing one more apple FOR EACH PERSON. If the remaining apples is greater than the number of people, or equal to them, you can distribute one more for each.
What division problem equals 22?
There are infinite division problems that equal 22. But, the most simple sum is 22÷1=22
