Advertisements
Advertisements
Question
A trader has three bundles of string 392 m, 308 m and 490 m long. What is the great est length of string that the bundles can be cut up into without any left over string?
Solution
The greatest length of string that the bundles can be cut up into without any left over the string is given by the HCF of 392, 308, and 490.
2 | 392 |
2 | 196 |
2 | 98 |
7 | 49 |
7 | 7 |
1 |
2 | 308 |
2 | 154 |
7 | 77 |
11 | 11 |
1 |
2 | 490 |
5 | 245 |
7 | 49 |
7 | 7 |
1 |
392 = 2 × 2 × 2 × 7 × 7
308 = 2 × 2 × 7 × 11
490 = 2 × 5 × 7 × 7
∴ HCF = 2 × 7 = 14
Hence, the greatest length of string that the bundles can be cut up into without any left-over string is 14 m.
RELATED QUESTIONS
Find out the LCM of the following number:
2, 3, 5
Veena has some beads. She wants to make necklaces with an equal number of beads in each. If she makes necklaces of 16 or 24 or 40 beads, there is no bead left over. What is the least number of beads with her?
An equal number of laddoos have been placed in 3 different boxes. The laddoos in the first box were distributed among 20 children equally, the laddoos in the second box among 24 children, and those in the third box among 12 children. Not a single laddoo was leftover. Then, what was the minimum number of laddoos in the three boxes altogether?
Find the LCM:
105, 195
Find the LCM:
12, 15, 45
Find the LCM:
36, 42
Find the LCM:
24, 40, 80, 120
The product of two two-digit numbers is 765 and their HCF is 3. What is their LCM?
If the LCM of 3 and 9 is 9, then their HCF is __________