Describe subtracting negative fractions, Mathematics

Assignment Help:

Describe Subtracting Negative Fractions?

Subtracting two fractions, whether one is positive and one is negative, or whether they are both negative, is almost the same process as when you add two fractions.

Find a common denominator. Then, subtract the numerators. Keep the denominators the same.
Example 1:
Subtract -2/3 -(-1)/12
-2/3 -(-1)/12 = (-2)/3 + 1/12 = -8/12 +1/12 = -8+1/12 = -7/12


Related Discussions:- Describe subtracting negative fractions

Indices, advantages and disadvantages of paasche and laspeyres indices

advantages and disadvantages of paasche and laspeyres indices

Find out that sets of functions are linearly dependent, Find out if the fol...

Find out if the following sets of functions are linearly dependent or independent.  (a) f (  x ) = 9 cos ( 2 x )    g (  x ) = 2 cos2 (  x ) -  2 sin 2 (  x ) (b) f

The number of filtering steps, The amount of particulate matter left in sol...

The amount of particulate matter left in solution during a filtering process is given by the equation p(n) = 500(2) -0.8n , where n is the number of filtering steps. Find the amoun

Sketch the feasible region, Sketch the feasible region for the following se...

Sketch the feasible region for the following set of constraints: 3y - 2x  ≥ 0 y + 8x  ≤  53 y - 2x  ≤  2 x  ≥ 3. Then find the maximum and minimum values of the objective

Algebra, Manuel is a cross-country runner for his school’s team. He jogged ...

Manuel is a cross-country runner for his school’s team. He jogged along the perimeter of a rectangular field at his school. The track is a rectangle that has a length that is 3 tim

Operations with rational numbers, larry spends 3/4 hours twice a day walkin...

larry spends 3/4 hours twice a day walking and playing with his dog. He spends 1/6 hours twice a day feeding his dog. how much time does larry spend on his dog each day?

NOWA method, solve the equation 540+115 using the NOWA method

solve the equation 540+115 using the NOWA method

Prove that prims algorithm produces a minimum spanning tree, Prove that Pri...

Prove that Prim's algorithm produces a minimum spanning tree of a connected weighted graph. Ans: Suppose G be a connected, weighted graph. At each iteration of Prim's algorithm

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd