Question

Use Euclid’s division lemma to find the HCF of 19 and 323​

Answer 1

Answer:

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

Step-by-step explanation:

hope it helps you

Answer 2

Answer:

Hi

good morning ⚡⚡

Step-by-step explanation:

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

Hope it'z Help ful ⚡⚡