Question

96,72 Euclid's algorithm

HCF​

Answer 1

Answer:

PLEASE MAKE MY ANSWER AS BRAINLIEST

Step-by-step explanation:

Euclid algorithm a=bq+r

Euclid algorithm a=bq+ra>b and 0⩽r<b.

Euclid algorithm a=bq+ra>b and 0⩽r<b.96 and 72

Euclid algorithm a=bq+ra>b and 0⩽r<b.96 and 72The positive integers are 96 and 72, 96>72

Euclid algorithm a=bq+ra>b and 0⩽r<b.96 and 72The positive integers are 96 and 72, 96>72Apply Euclid algorithm to 96 and 72,

Euclid algorithm a=bq+ra>b and 0⩽r<b.96 and 72The positive integers are 96 and 72, 96>72Apply Euclid algorithm to 96 and 72,∴96=(72∗1)+24

Euclid algorithm a=bq+ra>b and 0⩽r<b.96 and 72The positive integers are 96 and 72, 96>72Apply Euclid algorithm to 96 and 72,∴96=(72∗1)+24The remainder is 24.

Euclid algorithm a=bq+ra>b and 0⩽r<b.96 and 72The positive integers are 96 and 72, 96>72Apply Euclid algorithm to 96 and 72,∴96=(72∗1)+24The remainder is 24.Apply Euclid's algorithm to 72 and 24,

Euclid algorithm a=bq+ra>b and 0⩽r<b.96 and 72The positive integers are 96 and 72, 96>72Apply Euclid algorithm to 96 and 72,∴96=(72∗1)+24The remainder is 24.Apply Euclid's algorithm to 72 and 24,∴72=(24∗3)+0

Euclid algorithm a=bq+ra>b and 0⩽r<b.96 and 72The positive integers are 96 and 72, 96>72Apply Euclid algorithm to 96 and 72,∴96=(72∗1)+24The remainder is 24.Apply Euclid's algorithm to 72 and 24,∴72=(24∗3)+0The remainder is zero.

Euclid algorithm a=bq+ra>b and 0⩽r<b.96 and 72The positive integers are 96 and 72, 96>72Apply Euclid algorithm to 96 and 72,∴96=(72∗1)+24The remainder is 24.Apply Euclid's algorithm to 72 and 24,∴72=(24∗3)+0The remainder is zero.∴ HCF of 96 and 72 is 24.