Answer:
6
Step-by-step explanation:
Using Euclid's algorithm, we divide the larger by the smaller. If the remainder is zero, the divisor is the GCF. Otherwise, we replace the larger with the remainder and repeat.
18 ÷ 12 = 1 r 6
12 ÷ 6 = 2 r 0 . . . . the GCF is 6
__
You can also factor the numbers and see what the common factors are.
18 = 2·3·3
12 = 2·2·3
The common factors are 2·3 = 6.
In the factorizations, we see 2 to powers of 1 and 2, and we see 3 to powers of 1 and 2. The GCF is the product of the common factors to their lowest powers: (2^1)(3^1) = (2)(3) = 6
It’s 1.
Explanation: you need to find the greatest factor that works out for them both. You can cross out 4 and 8 because no other whole number can be multiplied to get 15, and it’s not 3 since you can’t multiply it with a whole number to get 64. 1 works for them both.
Answer:

Step-by-step explanation:










Answer:
C.
The equation that represents this situation is -3x = 21. The second number is -7.
Step-by-step explanation: