Question

please answer this question .whoever will answer this question correct and briefly i will mark him as the brainliest

Answer 1

Q2
ans

Let a be any positive integer and b = 6. Then, by Euclid’s algorithm,
a = 6q + r for some integer q ≥ 0, and r = 0, 1, 2, 3, 4, 5 because 0 ≤ r < 6.
Therefore, a = 6q or 6q + 1 or 6q + 2 or 6q + 3 or 6q + 4 or 6q + 5Also, 6q + 1 = = , where is a positive integer
6q + 3 = (6q + 2) + 1 = 2 (3q + 1) + 1 = , where is an integer
6q + 5 = (6q + 4) + 1 = 2 (3q + 2) + 1 = , where is an integer
Clearly, 6q + 1, 6q + 3, 6q + 5 are of the form 2k + 1, where k is an integer.
Therefore, 6q + 1, 6q + 3, 6q + 5 are not exactly divisible by 2. Hence, these expressions of
numbers are odd numbers.
And therefore, any odd integer can be expressed in the form 6q + 1, or 6q + 3,or 6q +5

Q3
and
We have to find the HCF (616, 32) to find the maximum number of columns in which
they can march.
To find the HCF, we can use Euclid’s algorithm.
Since, the last divisor is 8.
Therefore, the HCF (616, 32) is 8.
Therefore, they can march in 8 columns each.