Math, asked by sruchitha11, 1 year ago

in chapter real numbers do this 3rd problem

Answers

Answered by kaushik12
1
Hello !!
◆i think you need solution of question no
3 of 1st chapter from 10th class
hey please see below for the same

=> HCF (616, 32) will give the maximum number of columns in which they can march.
We can use Euclid's algorithm to find the HCF.
616 = 32 × 19 + 8
32 = 8 × 4 + 0
The HCF (616, 32) is 8.
Therefore, they can march in 8 columns each.
hope this helps you:)
please mark it as brainliest
Similar questions