answersLogoWhite

0


Best Answer

If you mean to divide one fraction by another, the easiest is to multiply your numerator fraction by the reciprocal of your denominator fraction.

For example, if:

x = (a / b) / (c / d)

then:

x = (ad)/(bc)

User Avatar

Wiki User

12y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What the algorithm for dividing 2 fraction?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

What is the algorithm for dividing a fraction by a fraction?

Multiply the first fraction by the reciprocal of the second. That is, flip the second fraction over and then multiply the two.


What algorithm makes sense for dividing any fraction by any fraction?

Hey Guys! I'm Not Sure That's Why I Am Asking You!.


What algorithm makes sense for dividing any fraction by any whole number?

multiply by the reciprocal of the whole number


How do you write the remainder 2 as a fraction?

The numerator of the fraction is '2'. The denominator of the fraction is the divisor (the number you were dividing by).


How do you describe an algorithm with rational numbers?

Describe an algorithm for dividing rational numbers.


What is a fraction that can be changed dividing it?

a fraction that can be changed by dividing it is called an improper fraction.


An algorithm for dividing rational numbers?

what is 5838945987. 54564894156=


How are multiplying and dividing fractions similar?

Dividing anything by a fraction is the same as multiplying by the fraction's reciprocal. For example, 4 ÷ 2/7 = 4 x 7/2 = 14


What is a flipped fraction called?

When the numbers within a fraction are reversed, this is called a reciprocal. A reciprocal is useful when dividing fractions - dividing by a fraction is the same as multiplying by its reciprocal.For example, 4 / 2/3 = 4 x 3/2 = 6.


How does dividing a number by a fraction involve multiplication?

When dividing by a fraction, the answer is obtained by multiplying by the reciprocal.


How can you use the Euclidean Algorithm to find the GCF of three numbers?

By dividing


How do you simplify a fraction with the Euclidean algorithm?

1) You use the Euclidian algorithm to find the greatest common factor between the numerator and the denominator. 2) You divide numerator and denominator by this greatest common factor. This will give you an equivalent fraction in simplest terms.