ᴀɴ ᴀʀᴍʏ ᴄᴏɴᴛɪɴɢᴇɴᴛ ᴏғ 616 ᴍᴇᴍʙᴇʀs ɪs ᴛᴏ ᴍᴀʀᴄʜ ʙᴇʜɪɴᴅ ᴀɴ ᴀʀᴍʏ ʙᴀɴᴅ ᴏғ 32 ᴍᴇᴍʙᴇʀs ɪɴ ᴀ ᴘᴀʀᴀᴅᴇ.ᴛʜᴇ ᴛᴡᴏ ɢʀᴏᴜᴘs ᴀʀᴇ ᴛᴏ ᴍᴀʀᴄʜ ɪɴ ᴛʜᴇ sᴀᴍᴇ ɴᴜᴍʙᴇʀs ᴏғ ᴄᴏʟᴜᴍɴs. ᴡʜᴀᴛ ɪs ᴛʜᴇ ᴍᴀxɪᴍᴜᴍ ɴᴜᴍʙᴇʀ ᴏғ ᴄᴏʟᴜᴍɴs ɪɴ ᴡʜɪᴄʜ ᴛʜᴇʏ ᴄᴀɴ ᴍᴀʀᴄʜ ?
Answers
Answered by
26
➤ Solution :
⇉ Maximum number of columns = HCF of 616 & 32.
Using Euclid's division algorithm,
⇉Since - 616 > 32
⇉We divide 616 by 32.
☞ [Refer attachment ⇈]
⇉The remainder we get is 8. (Not 0).
⇉So we divide 32 by 8.
☞ [Refer attachment ⇈]
⇉We get 0 as the remainder.
⇉Hence the HCF of 616 & 32 is 8.
➤ Therefore,
➤ Maximum number of columns = HCF of 616 & 32 = 8.
_________________________________
BTW WHY DID UH BLOCK ME??
Attachments:
Similar questions