Math, asked by pandu6141, 6 months ago

use Euclid's algorithm to find the HCF of (i) 1651 and 2032​

Answers

Answered by Gunjan1256
0

Step-by-step explanation:

using Euclid division lemma =

a=bq+r

we divide till no. that remainder comes not 0

Attachments:
Similar questions