Question

find the HCF of the pair of integers using euclid
algorithm 81 and 237

Answer 1

Euclid's Algorithm,

Dividend = Divisor × quotient + Remainder

HCF = 3

Hope this helps ;)