Finding the Least Common Multiple of Two Numbers by Factoring

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

You can find the least common multiple (LCM) of two numbers by multiplying together the highest power of each factor found in either number.

Contributed by: Jesse Nochella (March 2011)
Open content licensed under CC BY-NC-SA


Snapshots


Details

A faster way to compute the LCM of two numbers and is , which can take advantage of the efficiency of the Euclidean algorithm.



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send