Question

Using euclids division algorithm find the hcf of 570 and 1425

Answer 1

$a = bq + r \: \: ....0 \leqslant r < b \\ \\ 1425 = 570 \times 2 + 285 \\ r \: is \: not \: = 0 \\ 570 = 285 \times 2 + 0 \\ r = 0 \\ \\ so \: its \: hcf \: is \: 285 \\ \\ thanks$

Answer 2

Answer:

Higgest common factor (hcf) of 570 and 1425 is 285.

Step-by-step explanation:

Euclid's division algorithm states that  for any two positive integers m and n there exist a unique integers p and q such that m= np+q such that $0\leq q<n$

Given numbers are 570 and 1425

$1425=570\times 2+285$

\$570=285\times 2+0$

Since,we have obtained remainder 0, so hcf of 570 and 1425 is 285.

Division is shown in image attached below.