फाइंड द एचसीएफ ऑफ लाइन नंबर बाय प्राइम फ्रेक्शन मेथड 84,98
Answers
Step-by-step explanation:
HCF of 84 and 98 by Euclidean Algorithm
As per the Euclidean Algorithm, HCF(X, Y) = HCF(Y, X mod Y)
where X > Y and mod is the modulo operator.
Here X = 98 and Y = 84
HCF(98, 84) = HCF(84, 98 mod 84) = HCF(84, 14)
HCF(84, 14) = HCF(14, 84 mod 14) = HCF(14, 0)
HCF(14, 0) = 14 (∵ HCF(X, 0) = |X|, where X ≠ 0)
Therefore, the value of HCF of 84 and 98 is 14.
HCF of 84 and 98 by Listing Common Factors
Factors of 84: 1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84
Factors of 98: 1, 2, 7, 14, 49, 98
There are 4 common factors of 84 and 98, that are 1, 2, 14, and 7. Therefore, the highest common factor of 84 and 98 is 14.
HCF of 84 and 98 by Long Division
HCF of 84 and 98 by Long Division
HCF of 84 and 98 is the divisor that we get when the remainder becomes 0 after doing long division repeatedly.
Step 1: Divide 98 (larger number) by 84 (smaller number).
Step 2: Since the remainder ≠ 0, we will divide the divisor of step 1 (84) by the remainder (14).
Step 3: Repeat this process until the remainder = 0.
The corresponding divisor (14) is the HCF of 84 and 98.
make it to brainlist
Answer: HCF of 84 and 98 is 14 using prime factorisation method
Step-by-step explanation:
84= 2×2×3×7
98= 2×7×7
HCF= 2×7= 14