Want to protect your cyber security and still get fast solutions? Ask a secure question today.Go Premium

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

fractions

I have a recursive funtion that is supposed to
factor out the greatest common denominator.
long gcd(long x, long)
{
  return (x ==0L) ? y : gcd()y % x, x);
}
this works fine. I put two denominators in I get a number out
here is the question.
how I am I supposed to use this to add fraction.
if I put a 3,5 in I get a 1 out.
this is a silly question, I must be looking at this
at the wrong angle.
Please help.
0
strmtrpr
Asked:
strmtrpr
  • 3
1 Solution
 
strmtrprAuthor Commented:
that is supposed to be gcd(y % x, x);
sorry.
0
 
strmtrprAuthor Commented:
that is supposed to be gcd(y % x, x);
sorry.
0
 
newexpertCommented:
You can do it exactly as you do fraction addition by hand.
a/b + c/d = ( a*d + b*c ) / (b*d)
Now the result is not the simplest form.  We can reduce it to the simplest form by dividing both top and bottom by their gcd.
Therefore

a/b + c/d =  (A/gcd(A, B)) / (B/gcd(A, B)) where A = a*d + b*c and B = b*d
0
 
ozoCommented:
a/b + c/d = (a*d+b*c)/(b*d) = ((a*d+b*c)/gcd(b,d)) / (b*d/gcd(b,d))
0
 
strmtrprAuthor Commented:
I told you it was a silly question.

thanks for the help
0

Featured Post

Get expert help—faster!

Need expert help—fast? Use the Help Bell for personalized assistance getting answers to your important questions.

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