Question

Angel is trying to find the highest common factor of 468 and 222 using Euclid's division algorithm (EDA). In her second step, she gets the divisor of 24. Find the remainder at the end of the 2nd step​

Answer 1

Answer:

see the answer that is attached

Step-by-step explanation:

MARK ME AS BRAINLIEST

Answer 2

The value of the remainder at the end of the 2nd step​ is 6.

Step-by-step explanation:

Given:

The highest common factor of 468 and 222 using Euclid's division algorithm.

In Angel second step, she gets the divisor of 24.

To Find:

The value of remainder at the end of the 2nd step​.

Formula Used:

As per Euclid’s Division Lemma, for given two positive integers, 'm' and 'n', there exist unique integers, 'q' and 'r', such that: m = n q+r, where 0 ≤r <n.     Dividend = (Divisor × Quotient) + Remainder

Solution:

As given-the highest common factor of 468 and 222 using Euclid's division algorithm.

Applying Euclid's division algorithm.

1st step - $468=222\times2+24$

2nd Step -$222=24\times9+6$

3rd step - $24=6\times4+0$

It can be observed while process of getting HCF  in the 2nd Step 24 is used as divisor and the value of remainder is 6.

Thus,the value of the remainder at the end of the 2nd step​ is 6.

PROJECT CODE#SPJ2