Find the HCF of 4095 and 378 by using division algorithm method
Answers
Answered by
29
Hello dear friend .
Ur answer is here .
………………………………………………………………
step :1. since 4095 > 378 .
we apply Division lemme to 4095 and 378 to get ,
= > 4095 = 378 × 10 + 315
step :2. since 315≠ 0 ,
we apply the division lemma of 378 and 315 to get ,
=> 378 = 315 × 1 + 63
step :3. since 63 ≠ 0 ,
we apply the division lemma of 315 and 63 , to get .
=> 315 = 63 × 5 + 0
The remainder has now become zero, so our procedure stops. since , the Divisor at this steps is 63 ,
The HCF of 4095 and 378 is 63.
……………………………………………………………………

<<<☺☺>>>
Ur answer is here .
………………………………………………………………
step :1. since 4095 > 378 .
we apply Division lemme to 4095 and 378 to get ,
= > 4095 = 378 × 10 + 315
step :2. since 315≠ 0 ,
we apply the division lemma of 378 and 315 to get ,
=> 378 = 315 × 1 + 63
step :3. since 63 ≠ 0 ,
we apply the division lemma of 315 and 63 , to get .
=> 315 = 63 × 5 + 0
The remainder has now become zero, so our procedure stops. since , the Divisor at this steps is 63 ,
The HCF of 4095 and 378 is 63.
……………………………………………………………………
<<<☺☺>>>
DaIncredible:
amazing mam ✌
Similar questions