Question

Date.
rath.
ou Find the H.CF of the following by
using Euclid's division algoathe.
(A) 495,657​

Answer 1

Answer:

657=495×1+162

495=162×3+9

162=9×18+0

HCF=9

Answer 2

$\huge\mathcal{\underline{\underline{Answer:-}}}$

HCF(495,657) = 9

$\huge\mathcal{\underline{\underline{Solution:-}}}$

We find, HCF(495,657) using the following steps :

Step 1 : Since 495 < 657, we divide 657 by 495 to get 1 as the quotient and 162 as the remainder.

So, by Euclid's Division lemma, we get :

657 = 495 × 1 + 162

Step 2 : Since the remainder ≠ 0, we divide 495 by 162 to get 3 as the quotient and 9 as the remainder.

So, by Euclid's Division lemma, we get :

495 = 162 × 3 + 9

Step 3 : Since the remainder ≠ 0, we divide 162 by 9 to get 18 as the quotient and 0 as the remainder.

So, by Euclid's Division lemma, we get :

162 = 9 × 18 + 0

We see that the remainder has now become 0, thus our procedure stops here.

Hence, HCF(495,657) = 9