Math, asked by Harshlohani, 1 year ago

what is euclids division lemma and alogrithm?

Answers

Answered by Rishab143
0
This is used to calculate" highest common factor" or (hcf) of two positive integers
for example x and y.

if we divide the hcf of the two number x and y the remainder will be 0

According to Euclid’s Division Lemma if we have two positive integers x and y, then there exists unique integers q and r which satisfies the condition x = yq + r where 0 ≤ r ≤ y.



for example -14 and 117

suppose we divide 117 by 14 then we will get quotient =8 and remainder =5

here
dividend =117
divisor=14
quotient=8
remainder=5


clearly 117=(14×8)+5


i.e.,dividend=(divisor×quotient)+remainder








hey Friend ...!!!

i hope it will be helpful to you
and mark as brainliest if i deserve


thank you



;-)
Answered by ItzmysticalAashna
1

Answer:

ᴍɪss ᴍᴀsᴛᴇʀᴍɪɴᴅ~❤️

ɪɴ ɴᴜᴍʙᴇʀ ᴛʜᴇᴏʀʏ, ᴇᴜᴄʟɪᴅ's ʟᴇᴍᴍᴀ ɪs ᴀ ʟᴇᴍᴍᴀ ᴛʜᴀᴛ ᴄᴀᴘᴛᴜʀᴇs ᴀ ғᴜɴᴅᴀᴍᴇɴᴛᴀʟ ᴘʀᴏᴘᴇʀᴛʏ ᴏғ ᴘʀɪᴍᴇ ɴᴜᴍʙᴇʀs, ɴᴀᴍᴇʟʏ: ᴇᴜᴄʟɪᴅ's ʟᴇᴍᴍᴀ — ɪғ ᴀ ᴘʀɪᴍᴇ ᴘ ᴅɪᴠɪᴅᴇs ᴛʜᴇ ᴘʀᴏᴅᴜᴄᴛ ᴀʙ ᴏғ ᴛᴡᴏ ɪɴᴛᴇɢᴇʀs ᴀ ᴀɴᴅ ʙ, ᴛʜᴇɴ ᴘ ᴍᴜsᴛ ᴅɪᴠɪᴅᴇ ᴀᴛ ʟᴇᴀsᴛ ᴏɴᴇ ᴏғ ᴛʜᴏsᴇ ɪɴᴛᴇɢᴇʀs ᴀ ᴀɴᴅ ʙ.

Similar questions