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
Answer:
Step-by-step explanation:
(a,9).......we dont know " a " (or x) but we do know y...it is 9
so sub in 9 for y and solve for x
y = 2x + 1
9 = 2x + 1
9 - 1 = 2x
8 = 2x
8/2 = x
4 = x <======= ur answer is D
I would say 120 since it’s not at the end near 170
Answer:
it is when two triangles are similar to each other in every way.
Mainly there are 4 TYPES OF CONGRUENCY.(A.A.S, S.S.S, R.H.S, S.A.S )
