what is Euclid's division lemma
Answers
Answered by
2
HI MATE
Euclid's division lemma IS The basis of the Euclidean division algorithm is Euclid's division lemma. To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid's division algorithm. HCF is the largest number which exactly divides two or more positive integers.
Answered by
2
Answer:
ᴍɪss ᴍᴀsᴛᴇʀᴍɪɴᴅ~❤️
ɪɴ ɴᴜᴍʙᴇʀ ᴛʜᴇᴏʀʏ, ᴇᴜᴄʟɪᴅ's ʟᴇᴍᴍᴀ ɪs ᴀ ʟᴇᴍᴍᴀ ᴛʜᴀᴛ ᴄᴀᴘᴛᴜʀᴇs ᴀ ғᴜɴᴅᴀᴍᴇɴᴛᴀʟ ᴘʀᴏᴘᴇʀᴛʏ ᴏғ ᴘʀɪᴍᴇ ɴᴜᴍʙᴇʀs, ɴᴀᴍᴇʟʏ: ᴇᴜᴄʟɪᴅ's ʟᴇᴍᴍᴀ — ɪғ ᴀ ᴘʀɪᴍᴇ ᴘ ᴅɪᴠɪᴅᴇs ᴛʜᴇ ᴘʀᴏᴅᴜᴄᴛ ᴀʙ ᴏғ ᴛᴡᴏ ɪɴᴛᴇɢᴇʀs ᴀ ᴀɴᴅ ʙ, ᴛʜᴇɴ ᴘ ᴍᴜsᴛ ᴅɪᴠɪᴅᴇ ᴀᴛ ʟᴇᴀsᴛ ᴏɴᴇ ᴏғ ᴛʜᴏsᴇ ɪɴᴛᴇɢᴇʀs ᴀ ᴀɴᴅ ʙ.
Similar questions