Improve company productivity with a Business Account.Sign Up

x
  • Status: Solved
  • Priority: Medium
  • Security: Public
  • Views: 290
  • Last Modified:

fractions part2

I have this recursive function again.
long gcd (long x, long y)
{
   return (x==0L) ? y : gcd( y % x,x);
}
this is supposed to keep fractions in the lowest terms.
it works fine for addition and subtraction
how can I use it for multiplication and division.
I have always multiplied fractions like this
a/b *c/d = a *c / b*d
how can I use the gcd to reduce
thanks in advance.
0
strmtrpr
Asked:
strmtrpr
1 Solution
 
ozoCommented:
gcd(a*c,b*d)
0
 
nietodCommented:
Once you have your result

(a*c)/(b*d)

use GCD to find the greatest common factor of  the numerator and the denominator, that is

GCD(a*c,b*d)

Then divide the numerator and denumenator by this GCD value.  Let me know if you have questions.


0
 
strmtrprAuthor Commented:
that did it , I had the right idea I just messed up my syntax  a little.

Thank you for your help.
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

Join & Write a Comment

Featured Post

Free Tool: Port Scanner

Check which ports are open to the outside world. Helps make sure that your firewall rules are working as intended.

One of a set of tools we are providing to everyone as a way of saying thank you for being a part of the community.

Tackle projects and never again get stuck behind a technical roadblock.
Join Now