Use Euclid Algorithm To Find Hcf Of 135 And 225
Answers
Answered by
2
Answer:
here is ur answer ...plz have a look at the attachment...
hope it Will help u...
plz mark me as a brainlist....plz..
Attachments:
Answered by
5
Answer:
45 is the H.C.F of 135 and 225.
Step-by-step explanation:
⇛ Euclid's division algorithm :
- c = dq + r
⇛ Where :
- c, d = integers
- q, r = quotient, remainder
⇛ Here :
- 135 and 225 are the integers
⇛ We have 225 > 135, apply division lemma of Euclid to 135 and 225.
d - 135 | c - 225 | 1 - q
| 135
| r - 90
∴ 225 = 135 × 1 + 90
Since the remainder 90 ≠ 0, apply division lemma to 135 and 90.
90 | 135 | 1
| 90
| 45
∴ 135 = 90 × 1 + 45
Since the remainder 45 ≠ 0, apply division lemma to 90 and 45.
45 | 90 | 2
| 90
| 0
∴ 90 = 45 × 2 + 0
Since the remainder = 0, Euclid division lemma can be stopped, so the H.C.F of 135 and 225 is 45.
Learn more:
H.C.F of 4052 and 12576.
https://brainly.in/question/750351
H.C.F of 867 and 255.
https://brainly.in/question/13530584
Similar questions