Reducing fractions.

  • Thread starter Holocene
  • Start date
  • #1
231
0

Main Question or Discussion Point

Is there any way to derive the greatest common divisor from the prime factorizations of the numerator and denominator?


For instance:

[tex]\displaystyle{\frac{48}{150} = \frac{ 2 * 2 * 2 * 2 * 3}{2 * 3 * 5 * 5}}[/tex]

The GCD = 6 in this example, but is there any way to determine that from the prime factorizations alone?
 

Answers and Replies

  • #2
CRGreathouse
Science Advisor
Homework Helper
2,820
0
Is there any way to derive the greatest common divisor from the prime factorizations of the numerator and denominator?
Yes, that's the easiest (if not fastest) way. Just choose pairs of identical prime factors until none are left that match, then multiply the primes together.
 

Related Threads for: Reducing fractions.

  • Last Post
Replies
6
Views
721
  • Last Post
Replies
3
Views
886
  • Last Post
Replies
16
Views
3K
  • Last Post
Replies
5
Views
557
Replies
3
Views
2K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
3
Views
6K
  • Last Post
Replies
5
Views
2K
Top