3
$\begingroup$

I was experimenting with an algorithm for generating random numbers from a discrete distribution and came across an interesting observation. Suppose that you have any finite set of rational numbers in simplest form that sums to one, such as

$\frac{1}{2} + \frac{1}{3} + \frac{1}{6}$

$\frac{1}{4} + \frac{1}{5} + \frac{11}{20}$

$\frac{1}{3} + \frac{1}{3} + \frac{1}{3}$

I noticed that in each case, there is some fraction in each sum whose denominator is the least common multiple of all the denominators collectively. In the first example, $6 = LCM(2, 3, 6)$; in the second, $20 = LCM(4, 5, 20)$; in the third, $3 = LCM(3, 3, 3)$.

In all of the examples I've tried, this pattern occurs, but I'm not sure if this is just a coincidence or not. I've attempted to prove that this is true, but I can't make much progress on it.

Am I completely wrong that one of the fractions must have a denominator that's the LCM of the denominators? Or is there a proof that might help shed light on why this is?

Thanks!

  • 0
    Take the second one for instance, it can also be written as:$\frac{4}{16}+\frac{5}{25}+\frac{11}{20}$. So it's only true when the fraction can't be simplified any further.2011-12-25
  • 0
    @Raskolnikov- Ah yes, thanks for pointing that out. I've updated the question accordingly.2011-12-25
  • 4
    1/15+1/10+5/6 perhaps?2011-12-25
  • 1
    @Lopsy- D'oh! Thanks for pointing that out! If you promote that to an answer, I'll accept.2011-12-25
  • 0
    Sure, done! Interestingly enough, I might remember an old IMOSL problem that asked something similar: given any set of arithmetic sequences on the integers, such that every integer is in exactly one sequence, prove that the period of at least one of the sequences is equal to the the lcm of all the periods. I'll be thinking about that question too - this one is true, unless of course I remembered it wrong.2011-12-25
  • 0
    @templatetypedef I am happy that you care for math.SE by offering to accept Lopsy's Answer and make one less question for the site and reward Lopsy for the time he has spent.2011-12-25
  • 0
    I think the following weaker version is true: If n irreducible positive fractions add to one, and $n-1$ denominators are pairwise relatively prime, than the remaining denominator is their product...2011-12-26
  • 0
    @N.S. vacuously true because such thing does not exist.2012-01-08
  • 0
    Your third example is not the sum of a set of numbers, since the same number appears three times. It seems what you mean is a sum of several rational numbers?2012-01-08
  • 0
    @ChaoXu $\frac{1}{2}+\frac{1}{3}+\frac{1}{6}=1$ and $2$ and $3$ are relatively prime....Also $\frac{1}{m}+\frac{1}{n}+\frac{mn-m-n}{mn}$ would work...2012-01-19
  • 0
    @N.S. oh sorry, I thought you meant n denominators. and yes that would be true. It follows from the answer for http://math.stackexchange.com/questions/95720/bound-on-lcm-of-denominators-of-rational-numbers-that-sum-to-1/989032012-01-20

1 Answers 1

8

It's not always true: for example,

$\frac{1}{15}+\frac{1}{10}+\frac{5}{6}=1$

is a counterexample.

  • 6
    It's also not necessarily true even if all the numerators equal 1. See http://www.math.ubc.ca/~gerg/papers/downloads/recsum6.pdf for a particularly egregious counterexample.2011-12-26
  • 0
    @GregMartin your tax dollars at work!2013-06-19