Pre-Algebra 16 - Reducing Fractions

preview_player
Показать описание
The process of reducing any fraction to its simplest possible form is easily visualized using the number line.
Рекомендации по теме
Комментарии
Автор

My mind is blown. I’m an adult with a master’s degree, including accounting and finance classes and I’ve never seen math simplified to this extent. 👏🏾

misterwill
Автор

Just a heads up that I mentioned your video on my Pinterest board:
moomoomath/fraction resources


Thanks for the outstanding video.
Cheers,
Donna

MooMooMath
Автор

Wow, nice, nice edu video. Anims, sound, graphics, nice. Done in Flash?

marcusunlimited
Автор

Great video!! ove learned math so much easier with this!

PixelToxin
Автор

The bit I was confused by was getting 7 and 9 as the factors of 63 9 is not a prime number yet it is a factor of 63 how does that work i got the factor as 3 7 3 so obviously you multiplied the two 3s together to get it I felt that should have been explained further...

jonathanfreedman
Автор

HOW TO SIMPLIFY FRACTIONS THE EASIEST WAY:
If the difference between the numerator and denominator is 1, the fraction cannot be simplified.
A. Ask: does the numerator go into the denominator evenly (i.e. without any remainder)?
If yes, proceed to B.
If not, proceed to C.
B. Great! The simplest fraction is 1 over the number of times the numerator fits in the denominator. (e.g. 20/60, 20 fits evenly 3 times, hence 1/3.)
C. Write the remainder, (e.g. 20/46, (20 fits 2 times in 46, with a remainder of) 6.) to the right of the fraction, and ask: does the remainder go evenly into the numerator?
If yes, proceed to D.
If not, proceed to E.
D. Great! The "remainder" is the Greatest Common Factor. Divide both the numerator and denominator by the GCF/remainder to have the simplest fraction.
E. Write the "new remainder" (using the last example, 20/46, 6 fits into 20 with a "new remainder" of 2) to the right of the previous "remainder", and ask: does the "new remainder" fit evenly into the previous "remainder" (2 into 6)?
If yes, proceed to D.
If not, proceed to E.
Please, (with your amazing talent, ) produce a video demonstrating it.

//Euclidean Algorithm.

iqfncmq
Автор

Hmm, I've learned it when I was 10-12 year old. Here, in Russia, it's for children.

flance