Talk:Least common multiple

From Wikipedia, the free encyclopedia

I've heard this term describes as 'lowest common multiple'. maybe you could put in a redirect from that site to here? well i'm toddling off to bed now, goodnight. - Mark Ryan

There already was a redirect from Lowest_common_multiple. --Zundark, 2002 Jan 8

[edit] Proposed text on calculation method

does anyone think that this is a better way of calculating the LCM of 2 #s than what's posted?

The formula that works best: We will use 12 and 5 for out examples. To find the LCM of two numbers, put the larger of the two over the smaller in a fration (larger=numerator, smaller=denominator (12/5). Then you simplify the numbers (if they can't be simplified, as in this case, put the same improper fraction next to the original), and put the simplified version next to the unsilmplified version. 12/5 12/5 Then you cross multiply. 12 x 5, 12x 5. (numerator of original times denominator of simplified version) In this case, the answer is 60. Developed by Ben Cook (Aged 12 at the time) with help from Rob Cook (Also see Renderman computer graphics program, developed in part by Rob Cook). —The preceding unsigned comment was added by Beoknoc (talk • contribs) 20:53, 29 January 2006 .

[edit] section cleanup

I've put a "cleanup" tag on the section with the Venn diagram. The union of the two sets is naturally divided into three disjoint components: the intersection, and the two components of the symmetric difference. Only one of the latter two is non-empty. I'd like to see an example in which all three are non-empty. It's easy to come up with examples, but the graphics will require software that is not on the machine I'm at. Maybe I'll do something within the next couple of days. Michael Hardy (talk) 18:05, 18 February 2008 (UTC)

...and now I've replaced the image, rewritten the section, and deleted the "cleanup" tags. Michael Hardy (talk) 01:36, 19 February 2008 (UTC)