Question

using euclids division algorithm find hcf of 12 and 30​

Answer 1

Step-by-step explanation:

12=2×6=2×2×3=2^2×1

30=3×10=3×5×5=3×5^3

Answer 2

Answer:

Let a=30

b=12

formula of division lemma

a=bq+ r

so,30=12×6+2

since,the remainder 2 not equal to 0.

then again

a=bq+r

here,

let a=12

b= 6

so,

12= 6×1+6

remainder 6 not equal to 0.

again

a=bq+r

let a= 6

b=6

so, 6=6×1+0

the remainder has now become zero,so our procedure stops.since the divisor at this stage is 4,the HCF of 12 and 30 is 6

Step-by-step explanation:

Hope it helps you