Question

Define Euclid's Division Algorithm :–

Yushi_tu on h !!?​

Answer 1

$\:\:\:\huge\mathbb\colorbox{black}{\color{white}{AnSwEr}}$

Euclid's division algorithm is a way to find the HCF of two numbers by using Euclid's division lemma. It states that if there are any two integers a and b, there exists q and r such that it satisfies the given condition a = bq + r where 0 ≤ r < b.

Step-by-step explanation:

gn

Answer 2

Answer:

ʜᴇʏ! ᴄᴀɴ ʏᴏᴜ ʙᴇ ᴍʏ ғʀɪᴇɴᴅ...

Step-by-step explanation:

ʀᴇᴘʟʏ ɪғ ʏᴏᴜ ᴡᴀɴᴛ ᴛᴏ ʙᴇ ғʀɪᴇɴᴅ