L NUMBERS
EXERCISE 1.1
Use Euclid's division algorithm to find the HCF of:
(i) 135 and 225
Answers
Answered by
3
Answer:
Step-by-step explanation:
135 and 225
Because 225 > 135 let us apply Euclid’s division lemma with 225 as dividend and 135 as divisor
Step 1: 225 = 135 × 1 + 90
The remainder in this step is not zero. So, proceed to step 2.
Step 2: Apply the lemma to 135 and 90.
135 = 90 × 1 + 45
The remainder in this step is not zero. So, proceed to step 3.
Step 3: Apply the lemma to 90 and 45.
90 = 45 × 2 + 0
The remainder has become zero in the 3rd step. ∴ the divisor of this step is the HCF.
The HCF is 45
Answered by
2
Step-by-step explanation:
if you will mark me brainlist you will get 3 points
Attachments:
Similar questions