Question

Найди нод и нок чисел 50 и 8. какими способами можно это сделать? помогите, молю....!

Answer 1

НОК и НОД равен 2
Если  нужно могу сфоткать как решала))

Answer 2

Finding the Greatest Common Divisor (GCD) and Least Common Multiple (LCM) of 50 and 8

To find the greatest common divisor (GCD) and least common multiple (LCM) of 50 and 8, we can use different methods such as prime factorization, division method, or the Euclidean algorithm.

Using Prime Factorization: The prime factorization of 50 is 2 * 5^2, and the prime factorization of 8 is 2^3. To find the GCD and LCM using prime factorization, we can identify the common and uncommon prime factors.

The GCD is the product of the common prime factors raised to their lowest powers, which in this case is 2^1. Therefore, GCD(50, 8) = 2.

The LCM is the product of all prime factors raised to their highest powers, including the uncommon prime factors. In this case, LCM(50, 8) = 2^3 * 5^2 = 200.

Using Division Method: We can also find the GCD and LCM using the division method, which involves dividing the numbers and their remainders until the remainder becomes 0.

Using the Euclidean Algorithm: The Euclidean algorithm is another method to find the GCD of two numbers. It involves successive division and finding the remainder until the remainder is 0. The last non-zero remainder is the GCD.

Conclusion

Using the methods mentioned above, we can find that the GCD of 50 and 8 is 2, and the LCM is 200.