Question

Tell me fast.. Plzz plzzz ​

Answer 1

Answer:

27. PLEASE MARK ME AS THE BRAINLIEST

Step-by-step explanation:

108 = 22 × 33;

135 = 33 × 5;

Multiply all the common prime factors, by the lowest exponents.

Greatest (highest) common factor (divisor):

gcf, hcf, gcd (108; 135) = 33

gcf, hcf, gcd (108; 135) = 33 = 27;

the numbers have common prime factors

Integer numbers prime factorization

 

Approach 2. Euclid's algorithm:

Step 1. Divide the larger number by the smaller one:

135 ÷ 108 = 1 + 27;

Step 2. Divide the smaller number by the above operation's remainder:

108 ÷ 27 = 4 + 0;

At this step, the remainder is zero, so we stop:

27 is the number we were looking for, the last remainder that is not zero.

This is the greatest common factor (divisor).

Greatest (highest) common factor (divisor):

gcf, hcf, gcd (108; 135) = 27

gcf, hcf, gcd (108; 135) = 27 = 33;

Euclid's algorithm

 

Final answer:

Greatest (highest) common factor (divisor)

gcf, hcf, gcd (108; 135) = 27 = 33;

The numbers have common prime factors.