Least Common Multiple

vCalc Reviewed

Last modified by

on

Jul 24, 2020, 6:28:07 PM

Created by

on

Apr 27, 2014, 8:39:37 PM

`"LCM" = "Euclid's Algorithm"[ "a" , "b" ]`

`"Integer a"`

`"Integer b"`

Tags

UUID

687de1f0-0e07-11e3-8615-bc764e049c3d

[K-12 Education | Mathematics] The Euclidean algorithm is a method for computing the least common multiple (LCM). The LCM is the smallest number that can be divided by two numbers without producing a remainder. Using Euclid's algorithm to find the greatest common divisor (GCD) of two positive integers, leads to the LCM.

This equation, Least Common Multiple, references 1 page

Equations and Data Items

• Greatest Common Divisor by DavidC

Comments
Attachments
Stats

No comments

No attachments

Last 12 Months

This site uses cookies to give you the best, most relevant experience. By continuing to browse the site you are agreeing to our use of cookies.