Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
An army contingent of 616 members is to march behind an army band of 32 members in a parade. The two groups are to march in the same number of columns. What is the maximum number of columns in which they can march?
Given :
Members in the army contingent $= 616$
Members in an army band $= 32$
The two groups have to march in the sam
To find :
We have to find the maximum number of columns in which t
Solution :
To find the maximum number of columns we need to find HCF of 616 and 32.
By using Euclid's division lemma,
$$Dividend = Divisor \times Quotient + Remainder$$
Here, $616 > 32$.
So, Divide 616 by 32
$616 = 32 \times 19 + 8$
Remainder $= 8$.
Repeat the above process until we will get 0 as remainder.
Now, consider 32 as the dividend and 8 as the divisor
$32 = 8 \times 4 + 0$
Remainder $= 0$.
So, the Highest Common Divisor of 616 and 32 is 8.
Therefore,
Maximum number of columns in which two groups can march is 8.
58 Views
