Find the H.C.F of 36,48,72 by prime factorization method
Answers
Answer:
HCF of 36, 48, 72 is 12 the largest number which exactly divides all the numbers i.e. where the remainder is zero. Let us get into the working of this example. Highest common factor (HCF) of 36, 48, 72 is 12
PLS MARK ME AS BRAINLEST ANSWER
Answer:
Step-by-step explanation:
HCF of 36, 48, 72 is 12 the largest number which exactly divides all the numbers i.e. where the remainder is zero. Let us get into the working of this example.
Consider we have numbers 36, 48, 72 and we need to find the HCF of these numbers. To do so, we need to choose the largest integer first and then as per Euclid's Division Lemma a = bq + r where 0 ≤ r ≤ b
The highest common factor (HCF) of 36, 48, 72 is 12.
HCF(36, 48, 72) = 12
HCF of 36, 48, 72 using Euclid's algorithm
The highest common factor or Highest common divisor (HCD) can be calculated by Euclid's algorithm.
HCF of two or more Numbers
HCF of: 36, 48, 72
The highest common factor (HCF) of 36, 48, 72 is 12.
Highest Common Factor of 36,48,72 using Euclid's algorithm
Step 1: Since 48 > 36, we apply the division lemma to 48 and 36, to get
48 = 36 x 1 + 12
Step 2: Since the reminder 36 ≠ 0, we apply division lemma to 12 and 36, to get
36 = 12 x 3 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 12, the HCF of 36 and 48 is 12
Notice that 12 = HCF(36,12) = HCF(48,36) .
We can take HCF of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 72 > 12, we apply the division lemma to 72 and 12, to get
72 = 12 x 6 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 12, the HCF of 12 and 72 is 12
Notice that 12 = HCF(72,12) .
PLEASE MARK ME AS THE BRAINLIEST. THANK YOU.