0
Still curious? Ask our experts.
Chat with our AI personalities
Vivi
Blake
ProfessorAdd your answer:
Earn +20 pts
In division why should the remainder not be greater then the divisor?
If the remainder is greater than the divisor then you can divide it once more and get one more whole number and then have less remainders.
Is a remainder ever larger than the divisor?
I think that a remainder can be larger than a divisor, but I'm not completely sure.
Can the remanider in a division problem ever equal the divisor?
No, cause the remainder might be bigger than divisor.
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; }
Your quotient is 1 less than 27 divided by 9 you have no remainder what division fact are you?
10 \ 2
