Search results

Page title matches

• Least Common Multiple
  #REDIRECT[[least common multiple]]
  34 bytes (4 words) - 17:16, 14 May 2007
• Least common multiple
  The '''least common multiple''' (often abbreviated '''lcm''', or '''l.c.m.''') of two or more natural nu the least common multiple of some numbers is a number between the greatest of these numbers and their
  4 KB (614 words) - 05:43, 23 April 2010
• Least common multiple/Approval
  12 bytes (1 word) - 07:23, 4 November 2007
• Least common multiple/Definition
  103 bytes (14 words) - 07:56, 29 June 2009
• Least common multiple/Related Articles
  209 bytes (27 words) - 05:38, 3 July 2009
• Least common multiple/Student Level
  ...cs)|multiple]] of each of them. In [[algebra]], one may also speak of the least common multiple of several polynomials or of other, yet more abstract, objects. ...thm tells us that the greatest common divisor of 63 and 77 is 7. Then the least common multiple lcm(63, 77) is
  6 KB (743 words) - 18:42, 2 July 2009

Page text matches

• Smallest common multiple
  #REDIRECT[[least common multiple]]
  34 bytes (4 words) - 17:16, 14 May 2007
• Least Common Multiple
  #REDIRECT[[least common multiple]]
  34 bytes (4 words) - 17:16, 14 May 2007
• Multiple (mathematics)
  * [[Least common multiple]]
  924 bytes (151 words) - 22:50, 31 March 2008
• LCM (disambiguation)
  {{rpl|Least common multiple}}
  82 bytes (10 words) - 04:55, 24 September 2013
• Least common multiple
  The '''least common multiple''' (often abbreviated '''lcm''', or '''l.c.m.''') of two or more natural nu the least common multiple of some numbers is a number between the greatest of these numbers and their
  4 KB (614 words) - 05:43, 23 April 2010
• Divisibility/Related Articles
  {{r|least common multiple}}
  207 bytes (26 words) - 19:20, 23 June 2009
• Multiple (mathematics)/Related Articles
  {{r|Least common multiple}}
  495 bytes (63 words) - 18:42, 11 January 2010
• Least common multiple/Student Level
  ...cs)|multiple]] of each of them. In [[algebra]], one may also speak of the least common multiple of several polynomials or of other, yet more abstract, objects. ...thm tells us that the greatest common divisor of 63 and 77 is 7. Then the least common multiple lcm(63, 77) is
  6 KB (743 words) - 18:42, 2 July 2009
• Divisor
  ...th>m</math> such that <math>a | m</math> and <math>b | m</math>. Thus, the least common multiple of 12 and 9 is 36 (written <math>[12, 9] = 36</math>).
  4 KB (594 words) - 02:37, 16 May 2009
• Euclidean algorithm/Related Articles
  {{r|Least common multiple}}
  618 bytes (80 words) - 16:24, 11 January 2010
• Greatest common divisor/Related Articles
  {{r|least common multiple}}
  147 bytes (16 words) - 07:52, 29 June 2009
• Absorption (mathematics)
  * In the integers, [[highest common factor]] and [[least common multiple]];
  929 bytes (125 words) - 13:24, 18 November 2022
• Divisibility
  : the [[least common multiple]] is the smallest upper bound (or supremum).
  3 KB (515 words) - 21:49, 22 July 2009
• Integer/Related Articles
  {{r|Least common multiple}}
  2 KB (247 words) - 17:28, 11 January 2010
• Greatest common divisor
  Moreover, the gcd can be used to calculate the [[least common multiple]]:
  5 KB (797 words) - 04:57, 21 April 2010
• Order (group theory)
  ...to that power gives the identity. The exponent can be evaluated as the [[least common multiple]] of the orders of the elements. For an [[Abelian group]], there is always
  857 bytes (146 words) - 13:24, 1 February 2009
• Algebra/Related Articles
  {{r|Least common multiple}}
  2 KB (247 words) - 06:00, 7 November 2010
• Unique factorization
  ...wo positive whole numbers have a [[greatest common divisor]] (gcd) and a [[least common multiple]](lcm). In fact, knowing the prime factorization of two numbers makes it m
  3 KB (479 words) - 12:12, 9 April 2008
• Euclidean algorithm
  etc. The common denominator 38280855 is the [[least common multiple]] of the two denominators 357765 and 110959, and is much smaller than what
  7 KB (962 words) - 12:05, 3 May 2016
• RSA algorithm
  ...totient function]] of N, the product T = (p-1)(q-1). Alternately, find the least common multiple T = lcm( p-1, q-1) ([[#Implementation differences | discussion]]). Then cho | ISBN=0-8493-8523-7}}</ref>. Using the least common multiple has now become the usual implementation practice. It is slightly more effic
  7 KB (1,171 words) - 05:48, 8 April 2024