448, 616,728. 1064 what is HCF
Answers
Answer:
HCF OF 448, 616, 728, 1064 = 56.
Answer:
56 is the HCF of 448,616,728,1064
Step-by-step explanation:
HCF of 448 616 728 1064 by long division method
448 _| 616 |_ 1
448
______
168 _| 448 |_ 2
336
_____
112 _| 168 |_1
112
_____
56 _| 112 |_2
112
____
0
factors of the numbers :-
448=2⁶*7
616=2³*7*11
728=2³*7*13
1064=2³*7*19
common factors=2³ and 7
hcf=2³*7
=56
Highest Common Factor of 448,616,728,1064 using Euclid's algorithm
Step 1: Since 616 > 448, we apply the division lemma to 616 and 448, to get
616 = 448 x 1 + 168
Step 2: Since the reminder 448 ≠ 0, we apply division lemma to 168 and 448, to get
448 = 168 x 2 + 112
Step 3: We consider the new divisor 168 and the new remainder 112, and apply the division lemma to get
168 = 112 x 1 + 56
We consider the new divisor 112 and the new remainder 56, and apply the division lemma to get
112 = 56 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 56, the HCF of 448 and 616 is 56
Notice that 56 = HCF(112,56) = HCF(168,112) = HCF(448,168) = HCF(616,448) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 728 > 56, we apply the division lemma to 728 and 56, to get
728 = 56 x 13 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 56, the HCF of 56 and 728 is 56
Notice that 56 = HCF(728,56) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 1064 > 56, we apply the division lemma to 1064 and 56, to get
1064 = 56 x 19 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 56, the HCF of 56 and 1064 is 56
Notice that 56 = HCF(1064,56) .
Please Mark Me Brainliest