When is the lcm of a fraction sum

chatarazona7sq

chatarazona7sq

Answered question

2022-03-12

When is the lcm of a fraction sum the actual denominator.
Consider a sum
ab+cd=xy
where each fraction is reduced. Alternatively using the familiar process of lowest common denominators, we have
ab+cd=ad(b,d)+cb(b,d)bd
where (b,d) denotes the gcd and [b,d] denotes the lcm. My question is, when is it true that y=[b,d]? For example, this does not hold for
56+114=3842=1921
where 21 [14,6]
Are there any simple necessary and sufficient conditions for y=[b,d]?
Edit It has been suggested that
y=[b,d](b,d)=1
is a necessary and sufficient condition. I'm interested in either a proof or a counterexample if possible.
Edit 2 After a bit of searching, I've found
124+116=548
as a counterexample.
I am still looking for nice conditions for this to be satisfied and I feel that I should give an explanation of exactly what type of condition I am seeking. Angela has provided a necessary and sufficient condition, but it does not seem to be "simpler" than simply adding the fraction and seeing if it reduces. This is perhaps ambitious, but I am looking for a condition which is simple enough to use by inspection for simple fractions.

Answer & Explanation

Jamiya Bradford

Jamiya Bradford

Beginner2022-03-13Added 6 answers

let x=gcd(b,d)
b=xe
d=xf
ab+cd=af+ceefx
efx=lcm(b,d)
e,f are relative 's
The fraction simplifies when Undefined control sequence \cancel which is when Undefined control sequence \cancel

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?