###### Advertisements

###### Advertisements

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?

###### Advertisements

#### Solution

For the above problem, the maximum number of coulmns would be the HCF of 616 and 32

We can find the HCF of 616 and 32 by using Euclid Division algorithm.

Therefore

616 = 19 x 32 + 8

32 = 4 x 8 + 0

8 = 8 x 1 + 0

Therefore HCF (616, 32) = HCF of (32, 8) = 8

Therefore the maximum number of columns in which they can march is 8

#### APPEARS IN

#### RELATED QUESTIONS

Define HOE of two positive integers and find the HCF of the following pair of numbers:

155 and 1385

Without actual division, show that each of the following rational numbers is a terminating decimal. Express each in decimal form.

(i) `23/(2^3 × 5^2)`

Without actual division show that each of the following rational numbers is a non-terminating repeating decimal.

(i) `29/343`

Is it possible to have two numbers whose HCF if 25 and LCM is 520?

Show that \[3 + \sqrt{2}\] is an irrational number.

If *a* and *b* are relatively prime numbers, then what is their HCF?

If *n* is a natural number, then 9^{2n} − 4^{2n} is always divisible by

Find the largest number which on dividing 1251, 9377 and 15628 leave remainders 1, 2 and 3 respectively.

Prove that the product of two consecutive positive integers is divisible by 2

When the positive integers a, b and c are divided by 13, the respective remainders are 9, 7 and 10. Show that a + b + c is divisible by 13

Prove that square of any integer leaves the remainder either 0 or 1 when divided by 4

If d is the Highest Common Factor of 32 and 60, find x and y satisfying d = 32x + 60y

A positive integer, when divided by 88, gives the remainder 61. What will be the remainder when the same number is divided by 11?

Prove that two consecutive positive integers are always co-prime

Euclid’s division lemma states that for positive integers a and b, there exist unique integers q and r such that a = bq + r, where r must satisfy

Using Euclid’s division lemma, if the cube of any positive integer is divided by 9 then the possible remainders are

When the positive integers a, b and c are divided by 13 the respective remainders is 9, 7 and 10. Find the remainder when a b + + 2 3c is divided by 13

Show that 107 is of the form 4q +3 for any integer q

“The product of three consecutive positive integers is divisible by 6”. Is this statement true or false”? Justify your answer.