Question

Use Euclid's division algorithm to find HCF 135 and 225​

Answer 1

Answer:

According to given question

135 and 225

    By using Euclid's division Lemma

    Here you have to use this formula.

$a = bq +r \: \: \: where \: 0 \leqslant r < b$

Here a=225

        b=135

        c=value goes on changing according to

            number.

        r= where r is greater than zero but lesser

            than the  b.

    Here, 225>135

    225=135 *1 + 90

    Take the value of b and keep it in the place    

     a and 90 in the place of c.

    135 = 90 * 1 + 45

    Take the value of b and keep it in the place    

     a and 45 in the place of c.

     90 = 45 * 1 +0

    so here the remainder is zero

    HCF  of 135 and 225 is 45.

Answer 2

Answer:

Answer:

According to given question

135 and 225

    By using Euclid's division Lemma

    Here you have to use this formula.

a = bq +r \: \: \: where \: 0 \leqslant r < ba=bq+rwhere0⩽r<b

Here a=225

        b=135

        c=value goes on changing according to

            number.

        r= where r is greater than zero but lesser

            than the  b.

    Here, 225>135

    225=135 *1 + 90

    Take the value of b and keep it in the place    

     a and 90 in the place of c.

    135 = 90 * 1 + 45

    Take the value of b and keep it in the place    

     a and 45 in the place of c.

     90 = 45 * 1 +0

    so here the remainder is zero

    HCF  of 135 and 225 is 45.