LCM & GCD

* school math
[2025-10-11 Sat]

1. LCM & GCD

1.1. LCM

The LCD is needed for addition/subtraction. You can find it by dividing the multiple of both numbers by the GCD

1.2. GCD

The GCD can be found with eulers algorithm

\(\equation{a=bq+R}\)

1.2.1. Example

We will find the LCD and GCD of 698 & 368. 'a' will always be the largest number.

\begin{equation} \begin{aligned} & 698 = 368 * 1 + 330 \\ & 368 = 330 * 1 + 38 \\ & 330 = 38 * 8 + 26 \\ & 38 = 26 * 1 + 12 \\ & 26 = 12 * 2 + 2 \\ & 12 = 2 * 6 \end{aligned} \end{equation}

We can see that GCD is 2 Now to find the LCM

\(\begin{equation} \frac{(698 * 368)}{2}} \end{equation}\)

2. Elsewhere

2.1. References

2.2. In my garden

Notes that link to this note (AKA backlinks).

Recent changes. Attachment Index Tag Index Bibliography Index Source.