Question

use Euclid's division algorithm to find HCF of 156 and13​

Answer 1

Answer:

According to the Euclidean division algorithm, if we have two integers say a, b ie., 156, 13 the largest number should satisfy Euclid's statement a = bq + r where 0 ≤ r < b and get the highest common factor of 156, 13 as 13.

Answer 2

$\huge \fbox \red{S} \fbox \pink{o} \fbox \purple{l} \fbox\orange{u} \fbox \green{t}\fbox\red{I}\fbox\purple{o}\fbox\orange{n:-}$

According to the Euclid's division algorithm, if we have two integers say a, b ie.,

156, 13 the largest number should satisfy Euclid's statement a = bq + r where 0 ≤ r < b and get the highest common factor of 156, 13 as 13.