Rivalry2

HTML Diff

0 added 0 removed

Original 2026-01-01

Modified 2026-02-28

1 In this section, let’s see how to find the GCF of any two or more numbers. The common methods used to find the GCF are:

2 <ul><li>Listing Out Common Factors </li>

3 <li>Prime Factorization </li>

4 <li>Division Method </li>

5 </ul>Listing Out Common Factors

6 In this method, we write down the<a>factors</a>of the given number and identify the common factors to find the GCF. Follow these steps to find the GCF of any two or more numbers using listing out common factors:

7 Step 1:Write down all the factors of the given number.

8 Step 2:Identifying the common factors from the list.

9 Step 3:The largest number from the common factors is the GCF.

10 Now, let’s find the GCF of 81 and 72.

11 Step 1:List the factors of 81 and 72.

12 The factors of 81 are 1, 3, 9, 27, 81.

13 The factors of 72 are 1, 2, 3, 4, 6, 8, 9, 12, 18, 24, 36, 72.

14 Step 2:Identify the common factors from the list.

15 The common factors of 81 and 72 are 1, 3, 9.

16 Step 3:Find the largest number among the common factors

17 Here, the largest common factor is 9.

18 So, the GCF of 81 and 72 is 9.

19 Prime Factorization

20 In this method, the given number is broken down into its prime factors. Then the common prime factors are identified and multiplied to determine the GCF. Follow the steps mentioned below to find the GCF:

21 Step 1:Breaking the given number into its prime factors.

22 Step 2:Identify the common prime.

23 Step 3:Multiplying the common prime factors.

24 Now, let’s find the GCF of 28 and 24.

25 Step 1:Breaking the given number into its prime factors

26 The prime factorization of 28 is \(2 × 2 × 7 = 2² × 7\).

27 The prime factorization of 24 is \(2 × 2 × 2 × 3 = 2³ × 3\).

28 Step 2:Identifying the common prime.

29 The common prime factor is 2.

30 Step 3:Take the smallest<a>power</a>of the common factor.

31 Smallest power of \(2 = 2² = 4\).

32 GCF of 28 and 24 is 4.

33 Division Method

34 In this method, we divide the larger number by its smaller counterpart. Then the remainder is divided by the previous<a>divisor</a>. The process is repeated until the remainder is zero. Follow the steps given below to find the GCF using the<a>division</a>method:

35 Step 1:Dividing the largest number by the smallest number.

36 Step 2:If the remainder is 0 in the first step, then the divisor in step 1 will be the<a>dividend</a>in step 2. Now, the remainder will be the new divisor.

37 Step 3:When the remainder becomes 0, the divisor will be the GCF. If not, the process will be repeated.

38 Now, let’s find the GCF of 54 and 42.

39 Step 1:Dividing the largest number by the smallest number. So dividing 54 by 42, then the remainder is 12.

40 Step 2:Now divide the previous divisor 42 by the remainder 12. \(42 ÷ 12 = 3\) remainder 6.

41 Step 3:Divide the previous divisor 12 by the new remainder 6. \(12 ÷ 6 = 2\) remainder 0.

42 Step 4: When the remainder becomes 0, the divisor is the GCF. Therefor, the GCF of 54 and 42 is 6.