Question

Anandi is trying to find the highest
common factor of 875 and 625 using
Euclid's Division Algorithm (EDA).
In her 2nd step, she gets a divisor of 250,
Find the remainder at the end of 2nd
step.​

Answer 1

Answer:

125 using eulid's division algorithm

Answer 2

Answer:

125 is the answer

Step-by-step explanation:

EDA may sounds scary, but let'sit works through an example!

*Let's see we have 124 and 64.*

1. We start by dividing 124 by 64 to get the remainder.

devidend= 124

= divisior= 64. 1+ remainder= 60

we continue this process by dividing the divisior of each step by the remainder.

the the divisior at this stage is our HCF.

*Here, HCF is 4.*

Explanation: Here is the video that talks about EDA in detail.

[[Video 1]]

##Applying EDA

Here, we have 875 and 625. Using EDA. We can write-

875= 625.1+250........(Step 1)

625= 250.2+125.......(Step 2)

Hence, the remainder is 125 when the divisor is 250.

*Note: If we need to find the HCF we can continue this process till we have a O reminder.*

The reminder at the end of 2nd step is 125.

Hope It Helps You