Least Common Multiple

Inmathematicsthe least common multiple (abbreviated as l.c.m.), of two or more natural numbers is
the youngestnatural numberwhat ismultipleof all of them. It only applies withnatural numbersit
to say, are not useddecimalsnegative numbersocomplex numbers.
Calculation of the least common multiple (l.c.m)
Starting from two or more numbers and by decomposition into prime factors, expressed as
product of prime factors, its least common multiple will be the result of multiplying the factors
common and uncommon raised to the highest power, for example, the lcm of 72 and 50 will be:

Taking the common and non-common factors with their highest exponent, we have that:

Knowing the greatest common divisor of two numbers, the least common multiple can be calculated.
multiple of them, which will be the product of both divided by their greatest common divisor.

Basic properties

If we divide the product of two numbers by their greatest common divisor

sayingquotientit is the least common multiple.
AyB decomposed intoprime numberswill be A = (p1.p 2)·p 3.p 4yB=(p1·p 25.p 6where
if m.c.d. is (p1.p 2and the product of A·B=(p1.p 234·(p 12)·p 56where we see that (p1·p 2)
it is repeated twice, then if we divide that total by (p1·p 2we will have the lesser total
which contains A and B being their LCM

The least common multiple of two numbers, where the smaller divides the larger, will be
the largest. It is logical since a multiple of both lower than the largest would be impossible
since it would not be a multiple of the greatest.
The least common multiple of two prime numbers is the total of their multiplication.
This is logical since their greatest common divisor is 1.
The least common multiple of two composite numbers will be equal to the quotient.
between their product and the g.c.d of them. It is evident according to property 1 of this
theme.
The greatest common divisor of several numbers is included in the least common multiple.
multiple.
Applications of the least common multiple
Sum of fractions
See also:Minimum common denominator
 See also:Fraction
The LCM can be used to add or subtract.fractionsof differentdenominator
taking the LCM of the denominators of the fractions, and converting them
inequivalent fractionsthat can be summed. See the following example:

In order to perform the addition, one must first find the least common multiple.
of the denominators (6 and 33)

then the least common multiple of 6 and 33 is:

which corresponds to the number 66; both fractions will have as a denominator
66, now you just have to find the equivalent fraction for each fraction, with
denominator 66 and it will be possible to sum:

operating the fractions, we can perform the addition:

Algebraic expressions
The LCM for twoalgebraic expressionscorresponds to the algebraic expression of
minorcoefficientnumeric and of lower degree that is exactly divisible by each of the
given expressions. This theory is of utmost importance for fractions and equations.. 1

Of this shape the m.c.m. ofmonomials y is likewise

for y .
Calculation algorithms
For more than two numbers, one algorithm is the following:

1. Decompose the numbers into prime factors.

2. For each factor, choose from all the decompositions.
that factor with the highest exponent.
3. Multiply all the chosen factors.
For example, lcm(324,16,7,5) The decomposition of 324 is 22·3 4the decomposition of 16 is: 24;
the decomposition of 7 is 7 and the decomposition of 5 is 5. Therefore, we obtain the lcm:
24·34·7·5 = 45360.
Generalization of the concept of lcm and gcd.
The concept of lcm (least common multiple) and gcd (greatest common divisor) can be extended to fractions or rational numbers.
positiveos2Strictly speaking, any rational number divides another rational, and there is no
rational greater or less than all. However, the extension described here is of interest in some
problems and is related to thering theory, idealsBézout's identity theorem of
Krull, andtc.
In the case of theelementary classical arithmeticit would be applicable in the following example. Let there be 3
runners going around a circuit, if in each lap the first one takes 1/3 of a lap over the second one and
2/7 to the third. When will the three runners meet again at the finish line? It would also be
application in gear problems, etc.

They are two fractions. and irreducibles. Let it be

The prime factorization of So then

it is a fraction that is a common multiple of and it is the minimum due to the properties of the least common multiple.

gcd of two non-negative integers since it is the l.c.m. of the numerators

y it is the gcd of the denominators so that it can be concluded that

Similarly or taking into account that the product of two

the numbers equals to their lcm by their gcd we obtain:

GREATEST COMMON DIVISOR

Inmathematicsthe greatest common divisor (abbreviated as gcd) of two or morenumbers
integersto the highest number than thedividewithout leavingresto.For example, the gcd of 42 and 56 is 14. In
effect:

operating
 Being 3 and 4coprimethere is no natural number, apart from 1, that divides the
go to 3 and 4).
Clarifications
Let a and b be distinct non-zero integers, and if the number c is such that c|a and c|b,
This number is called the common divisor of the numbers a and b..1Note that two numbers
Any integers have common divisors. They are 1 and -1. When they exist, only.
as common divisors 1 and -1 of the numbers a and b, these are calledcoprime.
An integer is called the greatest common divisor (gcd) of the numbers a and b when: i) it divides both.
common divisor of the numbers ayby ii) is divisible by any other common divisor of the
numbersayb.
For example, 12 is the gcd of 36 and 60. Thus, 12|36 and 12|60; in turn, 12 is divisible by 1, -1, 2, -
2, 4, -4, 6, -6, 12, and -12 are common divisors of 36 and 60..2
Calculation of the gcd

The two most commonly used methods for calculating the greatest common divisor of two numbers are:
By decomposition into prime factors
Main article:Integer factorization
The greatest common divisor of two numbers can be calculated by determining thedecomposition in
prime factorsfrom the two numbers and taking the common factors raised to the lowest power,
the product of which will be the gcd.
Example: to calculate the greatest common divisor of 48 and 60, it is obtained from its factorization into
prime factors

The GCD is the common factors with their smallest exponent, that is:

In practice, this method is only operational for small numbers in general.

too much time to calculate the prime factorization of two random numbers.
Using the Euclidean algorithm
Main article:Euclidean algorithm
A more efficient method is theEuclid's algorithm,that uses thealgorithm of the
divisionalong with the fact that the gcd of two numbers also divides the remainder obtained from dividing the
greater among the smallest. For example, if you divide 60 by 48 giving a quotient of 1 and
a remainder of 12, the GCD will therefore be a divisor of 12. Then 48 is divided by 12 giving a
the remainder of 0, which means that 12 is the gcd. It can be formally described as:
Using the least common multiple
The greatest common divisor can also be calculated using theleast common
multiple.If a and b are different from zero, then the greatest common divisor of a and b is
obtained using the following formula, which involves the least common multiple (LCM)
deayb:

GCD of three or more numbers

The greatest common divisor of three numbers can be calculated as
follow: , although there are more methods
practical and simple.
Properties[edit]

Yes then

2. Yes it is an integer,

3. If it is a number first so o
good
4.
Yes
, then

5. If it is a common divisor of yes, and then

6. If , then
7.
Yes

,
so:

The last property indicates that the greatest common divisor of two numbers
it turns out to be the product of its common prime factors raised to the least
exponent.
Geometrically,the greatest common divisor of the number of points
of integer coordinates that are in the segment that joins the points (0,0) and
(a,b), excluding (0,0).
Propositions
1. For any pair of integers a≠0, b≠0, there exists a gcd.3
2. The gcd of the numbers ayb can be represented in the form
oflinear combinationof these numbers.
 3. If two integers arecoprimei.e. on mcd = 1 or another
notation (a,b) = 1, then the representation ma + nb = 1 fits
give me some integers(Bézout's Identity).
4. If a|bcy (a,b) = 1, then a|c. In other words, if a number divides
a product of two other numbers and iswe coverwith one of them,
then necessarily divide the other number or factorialtor.4
5. When a number is coprime with the numbers, it also
is with the product.5
Applications
The GCD is used to simplify.fractions.For example, to simplify the
The fraction is calculated first the gcd(60, 48) = 12, dividing the numerator
and the denominator of the initial fraction by 12 to obtain the fraction
simplified.
The gcd is also used to calculate theleast common multiple of two
numbers. In fact, the product of the two numbers is equal to the product of
its greatest common divisor by its least common multiple. Thus, to calculate the
least common multiple of 48 and 60, we first calculate their gcd, 12, being
its least common multiple .
The gcd and theEuclideanalgorithmis used in the resolution ofequations
linear diophantinewith two unknowns.6
 INTRODUCTION
Here you will find a series of relevant events in my life, being made known in the form
of spelling.
In this work, various stages of my life can be seen, but mainly the events that
more marked each one of them, as well as the changes and lessons that each one of the
The mentioned events served to shape my life, to make me the person I am today.

At the end of this work, you will find an analysis in which I summarize in a few words the
Conclusions I reached after completing my autobiography work.

CONCLUSION
After completing the previously presented autobiography, you can appreciate that there are many
people who have managed in one way or another to influence my life.

Just as understanding how the environment in which one operates can impact the
the person one becomes in the future, but I can't help but mention that in the end, one is who
Make your own decisions, as the owner of your actions is no more than the responsibility of each.
human being, and it is one who ultimately makes the decisions.
The environment may influence in some way, but nothing more.