Question

Делаю работу над ошибками и пж помогите! НОД (936;1404) НОК (936;1404)

Answer 1

Думаю, что понятно написала

Answer 2

Calculating the Greatest Common Divisor (НОД) and Least Common Multiple (НОК)

To calculate the Greatest Common Divisor (НОД) and Least Common Multiple (НОК) of two numbers, 936 and 1404, we can use mathematical methods.

Greatest Common Divisor (НОД)

The Greatest Common Divisor (НОД) of two numbers is the largest positive integer that divides each of the numbers without leaving a remainder.

The НОД of 936 and 1404 can be calculated using various methods, such as prime factorization, Euclidean algorithm, or using a calculator.

The prime factorization method involves breaking down each number into its prime factors and then finding the common prime factors with the highest exponent.

The Euclidean algorithm involves finding the НОД of two numbers by repeatedly applying the division algorithm.

Let's calculate the НОД of 936 and 1404 using the Euclidean algorithm:

936 ÷ 1404 = 0 with a remainder of 936 1404 ÷ 936 = 1 with a remainder of 468 936 ÷ 468 = 2 with a remainder of 0

Since the remainder is 0, the НОД of 936 and 1404 is the divisor, which is 468.

НОД (936, 1404) = 468

Least Common Multiple (НОК)

The Least Common Multiple (НОК) of two numbers is the smallest positive integer that is divisible by both numbers.

The НОК of 936 and 1404 can be calculated using the prime factorization method or by finding the product of the numbers divided by their НОД.

Let's calculate the НОК of 936 and 1404 using the product of the numbers divided by their НОД:

НОК (936, 1404) = (936 * 1404) / НОД (936, 1404)

Substituting the values: НОК (936, 1404) = (936 * 1404) / 468 НОК (936, 1404) = 1313824 / 468 НОК (936, 1404) = 2812

НОК (936, 1404) = 2812

So, the НОД of 936 and 1404 is 468, and the НОК of 936 and 1404 is 2812.