Success 

How to find the smallest multiple of a number. How to find the least common multiple, but for two or more numbers


The material presented below is a logical continuation of the theory from the article under the heading LCM - least common multiple, definition, examples, relationship between LCM and GCD. Here we will talk about finding the least common multiple (LCM), and pay special attention to solving examples. Let us first show how the LCM of two numbers is calculated in terms of the GCD of these numbers. Next, consider finding the least common multiple by factoring numbers into prime factors. After that, we will focus on finding the LCM of three or more numbers, and also pay attention to the calculation of the LCM of negative numbers.

Page navigation.

Calculation of the least common multiple (LCM) through gcd

One way to find the least common multiple is based on the relationship between LCM and GCD. The existing relationship between LCM and GCD allows you to calculate the least common multiple of two positive integers through the known greatest common divisor. The corresponding formula has the form LCM(a, b)=a b: GCD(a, b) . Consider examples of finding the LCM according to the above formula.

Example.

Find the least common multiple of the two numbers 126 and 70 .

Solution.

In this example a=126 , b=70 . Let us use the relationship between LCM and GCD expressed by the formula LCM(a, b)=a b: GCD(a, b). That is, first we have to find the greatest common divisor of the numbers 70 and 126, after which we can calculate the LCM of these numbers according to the written formula.

Find gcd(126, 70) using Euclid's algorithm: 126=70 1+56 , 70=56 1+14 , 56=14 4 , hence gcd(126, 70)=14 .

Now we find the required least common multiple: LCM(126, 70)=126 70: GCM(126, 70)= 126 70:14=630 .

Answer:

LCM(126, 70)=630 .

Example.

What is LCM(68, 34) ?

Solution.

Because 68 is evenly divisible by 34 , then gcd(68, 34)=34 . Now we calculate the least common multiple: LCM(68, 34)=68 34: LCM(68, 34)= 68 34:34=68 .

Answer:

LCM(68, 34)=68 .

Note that the previous example fits the following rule for finding the LCM for positive integers a and b : if the number a is divisible by b , then the least common multiple of these numbers is a .

Finding the LCM by Factoring Numbers into Prime Factors

Another way to find the least common multiple is based on factoring numbers into prime factors. If we make a product of all prime factors of these numbers, after which we exclude from this product all common prime factors that are present in the expansions of these numbers, then the resulting product will be equal to the least common multiple of these numbers.

The announced rule for finding the LCM follows from the equality LCM(a, b)=a b: GCD(a, b). Indeed, the product of the numbers a and b is equal to the product of all the factors involved in the expansions of the numbers a and b. In turn, gcd(a, b) is equal to the product of all prime factors that are simultaneously present in the expansions of the numbers a and b (which is described in the section on finding the gcd using the decomposition of numbers into prime factors).

Let's take an example. Let we know that 75=3 5 5 and 210=2 3 5 7 . Compose the product of all factors of these expansions: 2 3 3 5 5 5 7 . Now we exclude from this product all the factors that are present both in the expansion of the number 75 and in the expansion of the number 210 (such factors are 3 and 5), then the product will take the form 2 3 5 5 7 . The value of this product is equal to the least common multiple of the numbers 75 and 210, that is, LCM(75, 210)= 2 3 5 5 7=1 050.

Example.

After factoring the numbers 441 and 700 into prime factors, find the least common multiple of these numbers.

Solution.

Let's decompose the numbers 441 and 700 into prime factors:

We get 441=3 3 7 7 and 700=2 2 5 5 7 .

Now let's make a product of all the factors involved in the expansions of these numbers: 2 2 3 3 5 5 7 7 7 . Let us exclude from this product all the factors that are simultaneously present in both expansions (there is only one such factor - this is the number 7): 2 2 3 3 5 5 7 7 . In this way, LCM(441, 700)=2 2 3 3 5 5 7 7=44 100.

Answer:

LCM(441, 700)= 44 100 .

The rule for finding the LCM using the decomposition of numbers into prime factors can be formulated a little differently. If we add the missing factors from the expansion of the number b to the factors from the decomposition of the number a, then the value of the resulting product will be equal to the least common multiple of the numbers a and b.

For example, let's take all the same numbers 75 and 210, their expansions into prime factors are as follows: 75=3 5 5 and 210=2 3 5 7 . To the factors 3, 5 and 5 from the expansion of the number 75, we add the missing factors 2 and 7 from the expansion of the number 210, we get the product 2 3 5 5 7 , the value of which is LCM(75, 210) .

Example.

Find the least common multiple of 84 and 648.

Solution.

We first obtain the decomposition of the numbers 84 and 648 into prime factors. They look like 84=2 2 3 7 and 648=2 2 2 3 3 3 3 . To the factors 2 , 2 , 3 and 7 from the decomposition of the number 84 we add the missing factors 2 , 3 , 3 and 3 from the decomposition of the number 648 , we get the product 2 2 2 3 3 3 3 7 , which is equal to 4 536 . Thus, the desired least common multiple of the numbers 84 and 648 is 4,536.

Answer:

LCM(84, 648)=4 536 .

Finding the LCM of three or more numbers

The least common multiple of three or more numbers can be found by successively finding the LCM of two numbers. Recall the corresponding theorem, which gives a way to find the LCM of three or more numbers.

Theorem.

Let positive integers a 1 , a 2 , …, ak be given, the least common multiple mk of these numbers is found in the sequential calculation m 2 = LCM (a 1 , a 2) , m 3 = LCM (m 2 , a 3) , … , mk =LCM(mk−1 , ak) .

Consider the application of this theorem on the example of finding the least common multiple of four numbers.

Example.

Find the LCM of the four numbers 140 , 9 , 54 and 250 .

Solution.

In this example a 1 =140 , a 2 =9 , a 3 =54 , a 4 =250 .

First we find m 2 \u003d LCM (a 1, a 2) \u003d LCM (140, 9). To do this, using the Euclidean algorithm, we determine gcd(140, 9) , we have 140=9 15+5 , 9=5 1+4 , 5=4 1+1 , 4=1 4 , therefore, gcd(140, 9)=1 , whence LCM(140, 9)=140 9: LCM(140, 9)= 140 9:1=1 260 . That is, m 2 =1 260 .

Now we find m 3 \u003d LCM (m 2, a 3) \u003d LCM (1 260, 54). Let's calculate it through gcd(1 260, 54) , which is also determined by the Euclid algorithm: 1 260=54 23+18 , 54=18 3 . Then gcd(1 260, 54)=18 , whence LCM(1 260, 54)= 1 260 54:gcd(1 260, 54)= 1 260 54:18=3 780 . That is, m 3 \u003d 3 780.

Left to find m 4 \u003d LCM (m 3, a 4) \u003d LCM (3 780, 250). To do this, we find GCD(3 780, 250) using the Euclid algorithm: 3 780=250 15+30 , 250=30 8+10 , 30=10 3 . Therefore, gcd(3 780, 250)=10 , whence gcd(3 780, 250)= 3 780 250:gcd(3 780, 250)= 3 780 250:10=94 500 . That is, m 4 \u003d 94 500.

So the least common multiple of the original four numbers is 94,500.

Answer:

LCM(140, 9, 54, 250)=94,500.

In many cases, the least common multiple of three or more numbers is conveniently found using prime factorizations of given numbers. In this case, the following rule should be followed. The least common multiple of several numbers is equal to the product, which is composed as follows: the missing factors from the expansion of the second number are added to all the factors from the expansion of the first number, the missing factors from the expansion of the third number are added to the obtained factors, and so on.

Consider an example of finding the least common multiple using the decomposition of numbers into prime factors.

Example.

Find the least common multiple of five numbers 84 , 6 , 48 , 7 , 143 .

Solution.

First, we obtain the expansions of these numbers into prime factors: 84=2 2 3 7 , 6=2 3 , 48=2 2 2 2 3 , 7 prime factors) and 143=11 13 .

To find the LCM of these numbers, to the factors of the first number 84 (they are 2 , 2 , 3 and 7 ) you need to add the missing factors from the expansion of the second number 6 . The expansion of the number 6 does not contain missing factors, since both 2 and 3 are already present in the expansion of the first number 84 . Further to the factors 2 , 2 , 3 and 7 we add the missing factors 2 and 2 from the expansion of the third number 48 , we get a set of factors 2 , 2 , 2 , 2 , 3 and 7 . There is no need to add factors to this set in the next step, since 7 is already contained in it. Finally, to the factors 2 , 2 , 2 , 2 , 3 and 7 we add the missing factors 11 and 13 from the expansion of the number 143 . We get the product 2 2 2 2 3 7 11 13 , which is equal to 48 048 .

The greatest common divisor and the least common multiple are key arithmetic concepts that allow you to easily operate with ordinary fractions. LCM and are most often used to find the common denominator of several fractions.

Basic concepts

The divisor of an integer X is another integer Y by which X is divisible without a remainder. For example, the divisor of 4 is 2, and 36 is 4, 6, 9. A multiple of the integer X is a number Y that is divisible by X without a remainder. For example, 3 is a multiple of 15, and 6 is a multiple of 12.

For any pair of numbers, we can find their common divisors and multiples. For example, for 6 and 9, the common multiple is 18, and the common divisor is 3. Obviously, pairs can have several divisors and multiples, so the largest divisor of the GCD and the smallest multiple of the LCM are used in the calculations.

The smallest divisor does not make sense, since for any number it is always one. The largest multiple is also meaningless, since the sequence of multiples tends to infinity.

Finding GCD

There are many methods for finding the greatest common divisor, the most famous of which are:

  • sequential enumeration of divisors, selection of common ones for a pair and search for the largest of them;
  • decomposition of numbers into indivisible factors;
  • Euclid's algorithm;
  • binary algorithm.

Today, in educational institutions, the most popular methods of decomposition into prime factors and the Euclidean algorithm. The latter, in turn, is used in solving Diophantine equations: the search for GCD is required to check the equation for the possibility of resolving it in integers.

Finding the NOC

The least common multiple is also exactly determined by iterative enumeration or factorization into indivisible factors. In addition, it is easy to find the LCM if the largest divisor has already been determined. For numbers X and Y, LCM and GCD are related by the following relationship:

LCM(X,Y) = X × Y / GCM(X,Y).

For example, if gcd(15,18) = 3, then LCM(15,18) = 15 × 18 / 3 = 90. The most obvious use of LCM is to find the common denominator, which is the least common multiple of the given fractions.

Coprime numbers

If a pair of numbers has no common divisors, then such a pair is called coprime. The GCM for such pairs is always equal to one, and based on the connection of divisors and multiples, the GCM for coprime is equal to their product. For example, the numbers 25 and 28 are coprime, because they have no common divisors, and LCM(25, 28) = 700, which corresponds to their product. Any two indivisible numbers will always be coprime.

Common Divisor and Multiple Calculator

With our calculator you can calculate GCD and LCM for any number of numbers to choose from. Tasks for calculating common divisors and multiples are found in arithmetic of grades 5 and 6, however, GCD and LCM are the key concepts of mathematics and are used in number theory, planimetry and communicative algebra.

Real life examples

Common denominator of fractions

The least common multiple is used when finding the common denominator of several fractions. Suppose in an arithmetic problem it is required to sum 5 fractions:

1/8 + 1/9 + 1/12 + 1/15 + 1/18.

To add fractions, the expression must be reduced to a common denominator, which reduces to the problem of finding the LCM. To do this, select 5 numbers in the calculator and enter the denominator values ​​in the appropriate cells. The program will calculate LCM (8, 9, 12, 15, 18) = 360. Now you need to calculate additional factors for each fraction, which are defined as the ratio of LCM to the denominator. So the extra multipliers would look like:

  • 360/8 = 45
  • 360/9 = 40
  • 360/12 = 30
  • 360/15 = 24
  • 360/18 = 20.

After that, we multiply all the fractions by the corresponding additional factor and get:

45/360 + 40/360 + 30/360 + 24/360 + 20/360.

We can easily add such fractions and get the result in the form of 159/360. We reduce the fraction by 3 and see the final answer - 53/120.

Solution of linear diophantine equations

Linear Diophantine equations are expressions of the form ax + by = d. If the ratio d / gcd(a, b) is an integer, then the equation is solvable in integers. Let's check a couple of equations for the possibility of an integer solution. First, check the equation 150x + 8y = 37. Using a calculator, we find gcd (150.8) = 2. Divide 37/2 = 18.5. The number is not an integer, therefore, the equation does not have integer roots.

Let's check the equation 1320x + 1760y = 10120. Use a calculator to find gcd(1320, 1760) = 440. Divide 10120/440 = 23. As a result, we get an integer, therefore, the Diophantine equation is solvable in integer coefficients.

Conclusion

GCD and LCM play an important role in number theory, and the concepts themselves are widely used in various areas of mathematics. Use our calculator to calculate the largest divisors and smallest multiples of any number of numbers.

Let's continue the discussion about the least common multiple that we started in the LCM - Least Common Multiple, Definition, Examples section. In this topic, we will look at ways to find the LCM for three numbers or more, we will analyze the question of how to find the LCM of a negative number.

Yandex.RTB R-A-339285-1

Calculation of the least common multiple (LCM) through gcd

We have already established the relationship between the least common multiple and the greatest common divisor. Now let's learn how to define the LCM through the GCD. First, let's figure out how to do this for positive numbers.

Definition 1

You can find the least common multiple through the greatest common divisor using the formula LCM (a, b) \u003d a b: GCD (a, b) .

Example 1

It is necessary to find the LCM of the numbers 126 and 70.

Solution

Let's take a = 126 , b = 70 . Substitute the values ​​in the formula for calculating the least common multiple through the greatest common divisor LCM (a, b) = a · b: GCD (a, b) .

Finds the GCD of the numbers 70 and 126. For this we need the Euclid algorithm: 126 = 70 1 + 56 , 70 = 56 1 + 14 , 56 = 14 4 , hence gcd (126 , 70) = 14 .

Let's calculate the LCM: LCM (126, 70) = 126 70: GCD (126, 70) = 126 70: 14 = 630.

Answer: LCM (126, 70) = 630.

Example 2

Find the nok of the numbers 68 and 34.

Solution

GCD in this case is easy to find, since 68 is divisible by 34. Calculate the least common multiple using the formula: LCM (68, 34) = 68 34: GCD (68, 34) = 68 34: 34 = 68.

Answer: LCM(68, 34) = 68.

In this example, we used the rule for finding the least common multiple of positive integers a and b: if the first number is divisible by the second, then the LCM of these numbers will be equal to the first number.

Finding the LCM by Factoring Numbers into Prime Factors

Now let's look at a way to find the LCM, which is based on the decomposition of numbers into prime factors.

Definition 2

To find the least common multiple, we need to perform a number of simple steps:

  • we make up the product of all prime factors of numbers for which we need to find the LCM;
  • we exclude all prime factors from their obtained products;
  • the product obtained after eliminating the common prime factors will be equal to the LCM of the given numbers.

This way of finding the least common multiple is based on the equality LCM (a , b) = a b: GCD (a , b) . If you look at the formula, it will become clear: the product of the numbers a and b is equal to the product of all factors that are involved in the expansion of these two numbers. In this case, the GCD of two numbers is equal to the product of all prime factors that are simultaneously present in the factorizations of these two numbers.

Example 3

We have two numbers 75 and 210 . We can factor them out like this: 75 = 3 5 5 And 210 = 2 3 5 7. If you make the product of all the factors of the two original numbers, you get: 2 3 3 5 5 5 7.

If we exclude the factors common to both numbers 3 and 5, we get a product of the following form: 2 3 5 5 7 = 1050. This product will be our LCM for the numbers 75 and 210.

Example 4

Find the LCM of numbers 441 And 700 , decomposing both numbers into prime factors.

Solution

Let's find all the prime factors of the numbers given in the condition:

441 147 49 7 1 3 3 7 7

700 350 175 35 7 1 2 2 5 5 7

We get two chains of numbers: 441 = 3 3 7 7 and 700 = 2 2 5 5 7 .

The product of all the factors that participated in the expansion of these numbers will look like: 2 2 3 3 5 5 7 7 7. Let's find the common factors. This number is 7 . We exclude it from the general product: 2 2 3 3 5 5 7 7. It turns out that NOC (441 , 700) = 2 2 3 3 5 5 7 7 = 44 100.

Answer: LCM (441 , 700) = 44 100 .

Let us give one more formulation of the method for finding the LCM by decomposing numbers into prime factors.

Definition 3

Previously, we excluded from the total number of factors common to both numbers. Now we will do it differently:

  • Let's decompose both numbers into prime factors:
  • add to the product of the prime factors of the first number the missing factors of the second number;
  • we get the product, which will be the desired LCM of two numbers.

Example 5

Let's go back to the numbers 75 and 210 , for which we already looked for the LCM in one of the previous examples. Let's break them down into simple factors: 75 = 3 5 5 And 210 = 2 3 5 7. To the product of factors 3 , 5 and 5 number 75 add the missing factors 2 And 7 numbers 210 . We get: 2 3 5 5 7 . This is the LCM of the numbers 75 and 210.

Example 6

It is necessary to calculate the LCM of the numbers 84 and 648.

Solution

Let's decompose the numbers from the condition into prime factors: 84 = 2 2 3 7 And 648 = 2 2 2 3 3 3 3. Add to the product of the factors 2 , 2 , 3 and 7 numbers 84 missing factors 2 , 3 , 3 and
3 numbers 648 . We get the product 2 2 2 3 3 3 3 7 = 4536 . This is the least common multiple of 84 and 648.

Answer: LCM (84, 648) = 4536.

Finding the LCM of three or more numbers

Regardless of how many numbers we are dealing with, the algorithm of our actions will always be the same: we will consistently find the LCM of two numbers. There is a theorem for this case.

Theorem 1

Suppose we have integers a 1 , a 2 , … , a k. NOC m k of these numbers is found in sequential calculation m 2 = LCM (a 1 , a 2) , m 3 = LCM (m 2 , a 3) , … , m k = LCM (m k − 1 , a k) .

Now let's look at how the theorem can be applied to specific problems.

Example 7

You need to calculate the least common multiple of the four numbers 140 , 9 , 54 and 250 .

Solution

Let's introduce the notation: a 1 \u003d 140, a 2 \u003d 9, a 3 \u003d 54, a 4 \u003d 250.

Let's start by calculating m 2 = LCM (a 1 , a 2) = LCM (140 , 9) . Let's use the Euclidean algorithm to calculate the GCD of the numbers 140 and 9: 140 = 9 15 + 5 , 9 = 5 1 + 4 , 5 = 4 1 + 1 , 4 = 1 4 . We get: GCD(140, 9) = 1, LCM(140, 9) = 140 9: GCD(140, 9) = 140 9: 1 = 1260. Therefore, m 2 = 1 260 .

Now let's calculate according to the same algorithm m 3 = LCM (m 2 , a 3) = LCM (1 260 , 54) . In the course of calculations, we get m 3 = 3 780.

It remains for us to calculate m 4 \u003d LCM (m 3, a 4) \u003d LCM (3 780, 250) . We act according to the same algorithm. We get m 4 \u003d 94 500.

The LCM of the four numbers from the example condition is 94500 .

Answer: LCM (140, 9, 54, 250) = 94,500.

As you can see, the calculations are simple, but quite laborious. To save time, you can go the other way.

Definition 4

We offer you the following algorithm of actions:

  • decompose all numbers into prime factors;
  • to the product of the factors of the first number, add the missing factors from the product of the second number;
  • add the missing factors of the third number to the product obtained at the previous stage, etc.;
  • the resulting product will be the least common multiple of all numbers from the condition.

Example 8

It is necessary to find the LCM of five numbers 84 , 6 , 48 , 7 , 143 .

Solution

Let's decompose all five numbers into prime factors: 84 = 2 2 3 7 , 6 = 2 3 , 48 = 2 2 2 2 3 , 7 , 143 = 11 13 . Prime numbers, which is the number 7, cannot be factored into prime factors. Such numbers coincide with their decomposition into prime factors.

Now let's take the product of the prime factors 2, 2, 3 and 7 of the number 84 and add to them the missing factors of the second number. We have decomposed the number 6 into 2 and 3. These factors are already in the product of the first number. Therefore, we omit them.

We continue to add the missing multipliers. We turn to the number 48, from the product of prime factors of which we take 2 and 2. Then we add a simple factor of 7 from the fourth number and factors of 11 and 13 of the fifth. We get: 2 2 2 2 3 7 11 13 = 48,048. This is the least common multiple of the five original numbers.

Answer: LCM (84, 6, 48, 7, 143) = 48,048.

Finding the Least Common Multiple of Negative Numbers

In order to find the least common multiple of negative numbers, these numbers must first be replaced by numbers with the opposite sign, and then the calculations should be carried out according to the above algorithms.

Example 9

LCM(54, −34) = LCM(54, 34) and LCM(−622,−46, −54,−888) = LCM(622, 46, 54, 888) .

Such actions are permissible due to the fact that if it is accepted that a And − a- opposite numbers
then the set of multiples a coincides with the set of multiples of a number − a.

Example 10

It is necessary to calculate the LCM of negative numbers − 145 And − 45 .

Solution

Let's change the numbers − 145 And − 45 to their opposite numbers 145 And 45 . Now, using the algorithm, we calculate the LCM (145 , 45) = 145 45: GCD (145 , 45) = 145 45: 5 = 1 305 , having previously determined the GCD using the Euclid algorithm.

We get that the LCM of numbers − 145 and − 45 equals 1 305 .

Answer: LCM (− 145 , − 45) = 1 305 .

If you notice a mistake in the text, please highlight it and press Ctrl+Enter

But many natural numbers are evenly divisible by other natural numbers.

For example:

The number 12 is divisible by 1, by 2, by 3, by 4, by 6, by 12;

The number 36 is divisible by 1, by 2, by 3, by 4, by 6, by 12, by 18, by 36.

The numbers by which the number is divisible (for 12 it is 1, 2, 3, 4, 6 and 12) are called number divisors. Divisor of a natural number a is the natural number that divides the given number a without a trace. A natural number that has more than two factors is called composite .

Note that the numbers 12 and 36 have common divisors. These are the numbers: 1, 2, 3, 4, 6, 12. The largest divisor of these numbers is 12. The common divisor of these two numbers a And b is the number by which both given numbers are divisible without a remainder a And b.

common multiple several numbers is called the number that is divisible by each of these numbers. For example, the numbers 9, 18 and 45 have a common multiple of 180. But 90 and 360 are also their common multiples. Among all jcommon multiples, there is always the smallest one, in this case it is 90. This number is called leastcommon multiple (LCM).

LCM is always a natural number, which must be greater than the largest of the numbers for which it is defined.

Least common multiple (LCM). Properties.

Commutativity:

Associativity:

In particular, if and are coprime numbers , then:

Least common multiple of two integers m And n is a divisor of all other common multiples m And n. Moreover, the set of common multiples m,n coincides with the set of multiples for LCM( m,n).

The asymptotics for can be expressed in terms of some number-theoretic functions.

So, Chebyshev function. As well as:

This follows from the definition and properties of the Landau function g(n).

What follows from the law of distribution of prime numbers.

Finding the least common multiple (LCM).

NOC( a, b) can be calculated in several ways:

1. If the greatest common divisor is known, you can use its relationship with the LCM:

2. Let the canonical decomposition of both numbers into prime factors be known:

where p 1 ,...,p k are various prime numbers, and d 1 ,...,dk And e 1 ,...,ek are non-negative integers (they can be zero if the corresponding prime is not in the decomposition).

Then LCM ( a,b) is calculated by the formula:

In other words, the LCM expansion contains all prime factors that are included in at least one of the number expansions a, b, and the largest of the two exponents of this factor is taken.

Example:

The calculation of the least common multiple of several numbers can be reduced to several successive calculations of the LCM of two numbers:

Rule. To find the LCM of a series of numbers, you need:

- decompose numbers into prime factors;

- transfer the largest expansion to the factors of the desired product (the product of the factors of the largest number of the given ones), and then add factors from the expansion of other numbers that do not occur in the first number or are in it a smaller number of times;

- the resulting product of prime factors will be the LCM of the given numbers.

Any two or more natural numbers have their own LCM. If the numbers are not multiples of each other or do not have the same factors in the expansion, then their LCM is equal to the product of these numbers.

The prime factors of the number 28 (2, 2, 7) were supplemented with a factor of 3 (the number 21), the resulting product (84) will be the smallest number that is divisible by 21 and 28.

The prime factors of the largest number 30 were supplemented with a factor of 5 of the number 25, the resulting product 150 is greater than the largest number 30 and is divisible by all given numbers without a remainder. This is the smallest possible product (150, 250, 300...) that all given numbers are multiples of.

The numbers 2,3,11,37 are prime, so their LCM is equal to the product of the given numbers.

rule. To calculate the LCM of prime numbers, you need to multiply all these numbers together.

Another option:

To find the least common multiple (LCM) of several numbers you need:

1) represent each number as a product of its prime factors, for example:

504 \u003d 2 2 2 3 3 7,

2) write down the powers of all prime factors:

504 \u003d 2 2 2 3 3 7 \u003d 2 3 3 2 7 1,

3) write down all prime divisors (multipliers) of each of these numbers;

4) choose the largest degree of each of them, found in all expansions of these numbers;

5) multiply these powers.

Example. Find the LCM of numbers: 168, 180 and 3024.

Solution. 168 \u003d 2 2 2 3 7 \u003d 2 3 3 1 7 1,

180 \u003d 2 2 3 3 5 \u003d 2 2 3 2 5 1,

3024 = 2 2 2 2 3 3 3 7 = 2 4 3 3 7 1 .

We write out the largest powers of all prime divisors and multiply them:

LCM = 2 4 3 3 5 1 7 1 = 15120.

Definition. The largest natural number by which the numbers a and b are divisible without a remainder is called greatest common divisor (gcd) these numbers.

Let's find the greatest common divisor of the numbers 24 and 35.
The divisors of 24 will be the numbers 1, 2, 3, 4, 6, 8, 12, 24, and the divisors of 35 will be the numbers 1, 5, 7, 35.
We see that the numbers 24 and 35 have only one common divisor - the number 1. Such numbers are called coprime.

Definition. The natural numbers are called coprime if their greatest common divisor (gcd) is 1.

Greatest Common Divisor (GCD) can be found without writing out all the divisors of the given numbers.

Factoring the numbers 48 and 36, we get:
48 = 2 * 2 * 2 * 2 * 3, 36 = 2 * 2 * 3 * 3.
From the factors included in the expansion of the first of these numbers, we delete those that are not included in the expansion of the second number (i.e., two deuces).
The factors 2 * 2 * 3 remain. Their product is 12. This number is the greatest common divisor of the numbers 48 and 36. The greatest common divisor of three or more numbers is also found.

To find greatest common divisor

2) from the factors included in the expansion of one of these numbers, cross out those that are not included in the expansion of other numbers;
3) find the product of the remaining factors.

If all given numbers are divisible by one of them, then this number is greatest common divisor given numbers.
For example, the greatest common divisor of 15, 45, 75, and 180 is 15, since it divides all other numbers: 45, 75, and 180.

Least common multiple (LCM)

Definition. Least common multiple (LCM) natural numbers a and b are the smallest natural number that is a multiple of both a and b. The least common multiple (LCM) of the numbers 75 and 60 can be found without writing out multiples of these numbers in a row. To do this, we decompose 75 and 60 into simple factors: 75 \u003d 3 * 5 * 5, and 60 \u003d 2 * 2 * 3 * 5.
Let's write out the factors included in the expansion of the first of these numbers, and add to them the missing factors 2 and 2 from the expansion of the second number (i.e., we combine the factors).
We get five factors 2 * 2 * 3 * 5 * 5, the product of which is 300. This number is the least common multiple of the numbers 75 and 60.

Also find the least common multiple of three or more numbers.

To find the least common multiple several natural numbers, you need:
1) decompose them into prime factors;
2) write out the factors included in the expansion of one of the numbers;
3) add to them the missing factors from the expansions of the remaining numbers;
4) find the product of the resulting factors.

Note that if one of these numbers is divisible by all other numbers, then this number is the least common multiple of these numbers.
For example, the least common multiple of 12, 15, 20, and 60 would be 60, since it is divisible by all given numbers.

Pythagoras (VI century BC) and his students studied the issue of divisibility of numbers. A number equal to the sum of all its divisors (without the number itself), they called the perfect number. For example, the numbers 6 (6 = 1 + 2 + 3), 28 (28 = 1 + 2 + 4 + 7 + 14) are perfect. The next perfect numbers are 496, 8128, 33,550,336. The Pythagoreans knew only the first three perfect numbers. The fourth - 8128 - became known in the 1st century. n. e. The fifth - 33 550 336 - was found in the 15th century. By 1983, 27 perfect numbers were already known. But until now, scientists do not know whether there are odd perfect numbers, whether there is the largest perfect number.
The interest of ancient mathematicians in prime numbers is due to the fact that any number is either prime or can be represented as a product of prime numbers, that is, prime numbers are like bricks from which the rest of the natural numbers are built.
You probably noticed that prime numbers in the series of natural numbers occur unevenly - in some parts of the series there are more of them, in others - less. But the further we move along the number series, the rarer the prime numbers. The question arises: does the last (largest) prime number exist? The ancient Greek mathematician Euclid (3rd century BC), in his book "Beginnings", which for two thousand years was the main textbook of mathematics, proved that there are infinitely many prime numbers, that is, behind each prime number there is an even greater prime number.
To find prime numbers, another Greek mathematician of the same time, Eratosthenes, came up with such a method. He wrote down all the numbers from 1 to some number, and then crossed out the unit, which is neither a prime nor a composite number, then crossed out through one all the numbers after 2 (numbers that are multiples of 2, i.e. 4, 6 , 8, etc.). The first remaining number after 2 was 3. Then, after two, all numbers after 3 were crossed out (numbers that are multiples of 3, i.e. 6, 9, 12, etc.). in the end, only the prime numbers remained uncrossed out.