Question

plz.find the h.c.f of 432 and 504 using prime factorization
i am having a dought in this plz tell me

Answer 1

Approach 1. Integer numbers prime factorization:504 = 23 × 32 × 7; 
432 = 24 × 33;Take all the common prime factors, by the lowest exponents.Greatest (highest) common factor (divisor)
gcf, gcd (504; 432) = 23 × 32 = 72;Approach 2. Euclid's algorithm:Step 1. Divide the larger number by the smaller one:
 504 ÷ 432 = 1 + 72;Step 2. Divide the smaller number by the above operation's remainder: 
432 ÷ 72 = 6 + 0;At this step, the remainder is zero, so we stop: 
72 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, gcd (504; 432) = 72 = 23 × 32;Final answer:

Greatest (highest) common factor (divisor) 
gcf, gcd (504; 432) = 72 = 23 × 32; 
Numbers have common prime factors.

Calculator: greatest common factor (divisor) gcf, gcd

Answer 2

Answer:

Approach 1. Integer numbers prime factorization:504 = 23 × 32 × 7;  

432 = 24 × 33;Take all the common prime factors, by the lowest exponents.Greatest (highest) common factor (divisor)

gcf, gcd (504; 432) = 23 × 32 = 72;Approach 2. Euclid's algorithm:Step 1. Divide the larger number by the smaller one:

504 ÷ 432 = 1 + 72;Step 2. Divide the smaller number by the above operation's remainder:  

432 ÷ 72 = 6 + 0;At this step, the remainder is zero, so we stop:  

72 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, gcd (504; 432) = 72 = 23 × 32;Final answer:

Greatest (highest) common factor (divisor)  

gcf, gcd (504; 432) = 72 = 23 × 32;  

Numbers have common prime factors.

Calculator: greatest common factor (divisor) gcf, gcd

Step-by-step explanation: