Question

НОД 120 и 150!!!!!!!!!!

Answer 1

Ответ:

НОД(120;150)=30.

Пошаговое объяснение:

НОД(120;150)=2•3•5=30.

Answer 2

The greatest common divisor (GCD), also known as the highest common factor (HCF), of 120 and 150 can be found using various methods. One common method is the Euclidean algorithm.

To find the GCD of 120 and 150 using the Euclidean algorithm, you can follow these steps:

1. Divide the larger number (150) by the smaller number (120). 150 ÷ 120 = 1 remainder 30

2. Now, divide the previous divisor (120) by the remainder (30). 120 ÷ 30 = 4 remainder 0

3. Since the remainder is 0, the last nonzero remainder (30) is the GCD of 120 and 150.

Therefore, the GCD of 120 and 150 is 30.