GCF the 20 and also 36 is the largest possible number that divides 20 and also 36 precisely without any type of remainder. The factors of 20 and also 36 space 1, 2, 4, 5, 10, 20 and 1, 2, 3, 4, 6, 9, 12, 18, 36 respectively. There are 3 typically used techniques to uncover the GCF the 20 and also 36 - lengthy division, element factorization, and also Euclidean algorithm.

You are watching: Common factors of 20 and 36

 1 GCF that 20 and also 36 2 List that Methods 3 Solved Examples 4 FAQs

Answer: GCF of 20 and also 36 is 4. Explanation:

The GCF of two non-zero integers, x(20) and also y(36), is the biggest positive integer m(4) that divides both x(20) and also y(36) without any remainder.

Let's look at the various methods because that finding the GCF of 20 and 36.

Long department MethodListing usual FactorsUsing Euclid's Algorithm

### GCF the 20 and also 36 by lengthy Division GCF the 20 and 36 is the divisor the we get when the remainder becomes 0 after doing long department repeatedly.

Step 2: due to the fact that the remainder ≠ 0, we will certainly divide the divisor of step 1 (20) by the remainder (16).Step 3: Repeat this process until the remainder = 0.

The corresponding divisor (4) is the GCF of 20 and also 36.

### GCF of 20 and 36 through Listing common Factors Factors the 20: 1, 2, 4, 5, 10, 20Factors the 36: 1, 2, 3, 4, 6, 9, 12, 18, 36

There are 3 typical factors the 20 and 36, that space 1, 2, and 4. Therefore, the greatest usual factor that 20 and 36 is 4.

### GCF of 20 and also 36 through Euclidean Algorithm

As per the Euclidean Algorithm, GCF(X, Y) = GCF(Y, X mod Y)where X > Y and mod is the modulo operator.

See more: A Port City In Northeastern Italy, Port Of Ne Italy

Here X = 36 and Y = 20

GCF(36, 20) = GCF(20, 36 mod 20) = GCF(20, 16)GCF(20, 16) = GCF(16, 20 mod 16) = GCF(16, 4)GCF(16, 4) = GCF(4, 16 mode 4) = GCF(4, 0)GCF(4, 0) = 4 (∵ GCF(X, 0) = |X|, wherein X ≠ 0)

Therefore, the worth of GCF of 20 and 36 is 4.