Question

1)НОК (7056,8918) НОД (7056,8918)? 2)НОК(3858750,126) НОД(3858750,126) 3)НОК (526500,47520) НОД(526500,47520) 4)НОК (4275,612248) НОД(4275,612248)

Answer 1

1)  7056 = 72*98,  8918 = 91*98

НОК(7056;8918) = 642096

НОД(7056;8918) = 98

2)  3858750 = 30625*126

НОК = 3858750,  НОД = 1 - делителей нет.

3) 526500 = 540*975,  47520 = 540*88

НОК = 46332000  , НОД = 540

4)   НОК = 4275*612248 = 2617360200,  НОД= 1 - делителей нет.

Answer 2

To find the least common multiple (НОК) and greatest common divisor (НОД) of the given pairs of numbers, you can use the following formulas:

For two numbers a and b: НОК(a, b) = (a * b) / НОД(a, b) НОД(a, b) = gcd(a, b)

1. НОК(7056, 8918) and НОД(7056, 8918):

Step 1: Find the greatest common divisor (НОД): Using the Euclidean algorithm: gcd(7056, 8918) = gcd(8918, 7056) = gcd(7056, 1862) = gcd(1862, 367) = gcd(367, 299) = gcd(299, 68) = gcd(68, 3) = 3

Step 2: Find the least common multiple (НОК): НОК(7056, 8918) = (7056 * 8918) / НОД(7056, 8918) = (7056 * 8918) / 3 = 25081104

So, НОК(7056, 8918) = 25081104 and НОД(7056, 8918) = 3

2. НОК(3858750, 126) and НОД(3858750, 126):

Step 1: Find the greatest common divisor (НОД): Using the Euclidean algorithm: gcd(3858750, 126) = gcd(126, 3858750 % 126) = gcd(126, 110) = gcd(110, 126 % 110) = gcd(110, 16) = gcd(16, 110 % 16) = gcd(16, 6) = gcd(6, 16 % 6) = gcd(6, 4) = gcd(4, 6 % 4) = gcd(4, 2) = gcd(2, 4 % 2) = gcd(2, 0) = 2

Step 2: Find the least common multiple (НОК): НОК(3858750, 126) = (3858750 * 126) / НОД(3858750, 126) = (3858750 * 126) / 2 = 243003750

So, НОК(3858750, 126) = 243003750 and НОД(3858750, 126) = 2

3. НОК(526500, 47520) and НОД(526500, 47520):

Step 1: Find the greatest common divisor (НОД): Using the Euclidean algorithm: gcd(526500, 47520) = gcd(47520, 526500 % 47520) = gcd(47520, 23580) = gcd(23580, 47520 % 23580) = gcd(23580, 40) = gcd(40, 23580 % 40) = gcd(40, 20) = gcd(20, 40 % 20) = gcd(20, 0) = 20

Step 2: Find the least common multiple (НОК): НОК(526500, 47520) = (526500 * 47520) / НОД(526500, 47520) = (526500 * 47520) / 20 = 124284000

So, НОК(526500, 47520) = 124284000 and НОД(526500, 47520) = 20

4. НОК(4275, 612248) and НОД(4275, 612248):

Step 1: Find the greatest common divisor (НОД): Using the Euclidean algorithm: gcd(4275, 612248) = gcd(612248, 4275) = gcd(4275, 3623) = gcd(3623, 652) = gcd(652, 263) = gcd(263, 126) = gcd(126, 11) = gcd(11, 4) = gcd(4, 3) = gcd(3, 1) = 1

Step 2: Find the least common multiple (НОК): НОК(4275, 612248) = (4275 * 612248) / НОД(4275, 612248) = (4275 * 612248) / 1 = 2612435100

So, НОК(4275, 612248) = 2612435100 and НОД(4275, 612248) = 1