0
What else can I help you with?
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; }
X2 -12x plus 32?
x2 - 12x + 32 = 0 x2 - 8x - 4x +32 = 0 x(x -8) - 4(x -8) = 0 (x - 4)(x - 8) = 0 x = 4 or x = 8
What is the factored equation for 63X2 44X-32?
63x^2 + 44x - 32 = 0 (9x - 4)(7x + 8) = 0
What is the difference between cube and cylinder?
A cube has straight edges whereas a cylinder has round edges
What is the binary 10110101 as a decimal?
128 + 0 + 32 + 16 + 0 + 4 + 0 + 1 = 181
What is the greatest common divisor of 0 and 12?
Zero is nothing, nada, nil, zip. It doesn't have any factors so it can't have any in common.
The questions asks When a number is divided by 32 what is the greatest value the remainder may have?
When a number is divided by 32, the remainder can range from 0 to 31, as the remainder can never be greater than the divisor. Therefore, the greatest value the remainder may have is 31.
What is the greatest common divisor of 165 and 297?
The greatest common divisor (GCD) of two numbers is the largest positive integer that divides both numbers without leaving a remainder. To find the GCD of 165 and 297, you can use the Euclidean algorithm. First, divide 297 by 165 to get a quotient of 1 and a remainder of 132. Then, divide 165 by 132 to get a quotient of 1 and a remainder of 33. Finally, divide 132 by 33 to get a quotient of 4 and a remainder of 0. Since the remainder is 0, the GCD of 165 and 297 is 33.
Is there such thing as a least common divisor?
As 1 divides every number, 1 is the least common divisor in all cases. The only exception is when all numbers considered are 0, as 0 divides all of them in that particular case and so is the least common divisor then.
What is the least common multiple of 88 and 56?
use the equation lcm(a,b)=ab/gcd(a,b) gcd = greatest common divisor gcd(88,56) use euclidean algortihm 88=56x1+32 56=32x1+24 32=24x1+8 24=8x2+0 therefore the gcd is 8. so lcm(88,56)= 88x56/8 =616
How do you prove that if the greatest common factor of A and B equals 1 and C does not equal 0 then the greatest common factor of AC and BC divides C?
If the greatest common factor/divisor of A and B is 1 then they are coprime - they do not share any prime factors. Multiplying both through by C means, obviously, that each number now divides by C. In fact, C is their greatest common divisor, since AC and BC do not have further common factors after C is taken out. Hence the GCF of AC and BC is not merely a factor of C - it is C. (The question makes sense only if A, B and C are integers.)
What is the greatest remainder when the divisor is 3?
When dividing by 3, the possible remainders are 0, 1, or 2. Therefore, the greatest remainder when the divisor is 3 is 2. This means that any integer can yield a remainder of up to 2 when divided by 3.
What is the greatest remainder for the divisor 5?
The greatest remainder when dividing by 5 is 4. This is because when a number is divided by 5, the possible remainders are 0, 1, 2, 3, and 4. Since 4 is the highest value in this set, it is the greatest remainder one can obtain when using 5 as the divisor.
What is the greatest common factor of 245 and 175?
The greatest common factor (GCF) is often also called the greatest common divisor (GCD) or highest common factor (HCF). Keep in mind that these different terms all refer to the same thing: the largest integer which evenly divides two or more numbers.The greatest common factor of 175 and 245 is 35
Is 0 is a divisor of 12?
No. Division by 0 is not defined so 0 is not a divisor of any number.
How do find the greatest common divisor?
The Greatest Common Divisor is the number that divides all the given numbers evenly (with a reminder of '0') and also is the greatest of all possible divisors that are common to all the numbers. Step 1: Identify all the factors/divisors of the numbers Step 2: Select only the numbers that are common factors for all the given input numbers Step 3: Choose the greatest of the factors and select it as the GCD
What is another way to find GCF than listing them out?
Find the greatest common factor (or the greatest common divisor) of 1582 and 1678.1. Prime factorization:1582 = 2 x 7 x 1131678 = 2 x 839The GCF is 2.Euclidean Algorithm:1678 = 1 x 1582 + 961582 = 16 x 96 + 4696 = 2 x 46 + 446 = 11 x 4 + 24 = 2 x 2 + 0Since the remainder in the last equation is 0, then the greatest common divisor (or factor) is 2.
