For example:
Seek 6,
15,
60 greatest common divisor and least common multiple
The process is as follows:
6,
15,
60 * * * prime factor is:
2,
3,
5,
The least common multiple is:
2
×
three
×
five
×
1
×
1
×
2
=
60
The greatest common divisor is 3.
Turn left | turn right