Simplify Fractions: Tips and Tricks for Quick and Easy Simplification

Click For Summary

Homework Help Overview

The discussion revolves around simplifying fractions, particularly focusing on methods to reduce larger fractions like 122/163. Participants explore various approaches to find common factors and the greatest common divisor.

Discussion Character

  • Exploratory, Conceptual clarification, Mathematical reasoning

Approaches and Questions Raised

  • Participants discuss comparing factors and the limitations of trial and error. Some suggest using small prime numbers for division, while others mention the Euclidean algorithm as a potential method for finding the greatest common divisor.

Discussion Status

There is an ongoing exploration of different methods for simplifying fractions. Some participants have shared insights and suggestions, including the use of the Euclidean algorithm, which has been positively acknowledged by one participant.

Contextual Notes

Participants are navigating the challenge of simplifying larger fractions and are considering various mathematical techniques without reaching a definitive consensus on the best approach.

TSN79
Messages
422
Reaction score
0
I'm wondering about fractions, and how I can simplify them. If they're small like 6/10, I see it straight away, but if they're big like 122/163, I don't really know where to start without resorting to random trial and error...
Isn't there a more structural procedure to simplify fractions as much as possible?
 
Physics news on Phys.org
the only way I can think of off the top of my head is comparing factors...which is a litle better than trial and error.
ie: factors of 122 include (I'll probably miss some) 1,2,61,122
but the 163 is prime and only has factors of 1,163.
Since no factors (besides 1) overlap the fraction cannot be reduced. But if you had a common factor X then both the top and bottom could be divided by X to get an equivalent but reducded form of the fraction.
 
dmoravec's got it.

Try dividing both top and bottom by small primes -- 2, 3, 5, 7, etc. -- until either the top or bottom is prime, or they share no common factors.

- Warren
 
You might try looking at the http://en.wikipedia.org/wiki/Euclidean_algorithm" for finding the greatest common divisor of two numbers.
 
Last edited by a moderator:
Hey thanks all. That Euclidean algorithm worked like a charm. Fancy.
 

Similar threads

  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
Replies
2
Views
2K
  • · Replies 19 ·
Replies
19
Views
13K
  • · Replies 10 ·
Replies
10
Views
4K
Replies
7
Views
8K