Simplify
Given that 134791,6399,6341. Clearly, 134791 > 6399 . Applying Euclid’s division lemma to 134791 and 6399,we get
134791 = 6399 X 2 + 412
Since the remainder 412 ≠ 0 . So, we apply the division lemma to the divisor 6399 ande remainder 412 to get
6399 = 412 X 15 + 219
Now we apply the division lemma to new divisior 412 and remainder 219 to get
412 = 219 X 1 + 193
Now we apply the division lemma to new divisior 219 and remainder 193 to get
219 = 193 X 1 + 26
Now we apply the division lemma to new divisior 193 and remainder 26 to get
193 = 26 x 7 + 11
Now we apply the division lemma to new divisior 26 and remainder 11 to get
26 = 11 X 2 + 4
Now we apply the division lemma to new divisior 11 and remainder 4 to get
11 = 4 X 2 + 3
Now we apply the division lemma to new divisior 4 and remainder 3 to get
4 = 3 X 1 + 1
Now we apply the division lemma to new divisior 3 and remainder 1 to get
3 = 3 X 1 + 0
The remainder at this stage is zero. So , the divisor at this stage and the remainder at the previous stage i.e. 1 is the HCF of 134791 and 6399
Now 6341 > 1 . Clearly, when we applying division lemma then get 1 as HCF.
So , HCF of 134791 , 6341 , 6399 is 1.
