Find the H.C.F. of 567 and 255 using Euclid's division lemma.
Answers
Answer:
Here is your answer .
Step-by-step explanation:
here .
a = 255 and b= 567 .
By Euclid's Lemma Division
a = bq + r .
Next answer in the image .
H.C.F.(567,255) = 3
Given:
- Two numbers.
- 567 and 255.
To find:
- Find the H.C.F. using Euclid's division lemma.
Solution:
Concept to be used:
Euclid's division lemma:
If two positive numbers 'a' and 'b' are like that a>b, then these can be written as
where
Step 1:
To find HCF using Euclid's division lemma, write the numbers as follows:
As 567 > 255, so take 567 as 'a' and 255 as 'b'.
Step 2:
Change the divisor and dividend.
by the same way, repeat the steps,until we get a remainder zero.
and
When remainder is zero, then dividend will be the HCF of both numbers.
Or we can say HCF is remainder of second last step.
Thus,
H.C.F.(567,255) = 3
Learn more:
1) Using euclid division algorithm find hcf of 81 and 237
https://brainly.in/question/6877877
2) find hcf of 81 and 237 .Express the HCF in the form of 237p+81q .Find the value of
(3p +q)
answer is 1 .
https://brainly.in/question/33274306