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?
Advertisements
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
We observed the traffic lights at three different squares on the same big road. They turn green every 60 seconds, 120 seconds and 24 seconds. When the signals were switched on at 8 o’clock in the morning, all the lights were green. How long after that will all three signals turn green simultaneously again?
Find the LCM:
15, 30, 90
Find the HCF and LCM:
17, 102, 170
Find the LCM:
18, 42, 48
Reduce the fractions `348/319, 221/247, 437/551` to the lowest terms.
Find the LCM of the numbers given below:
36, 40, 126
Find the LCM set of numbers using prime factorisation method.
15, 25, 75
Find L.C.M of the given number.
12 and 28
Find the least number which when divided by 6, 15 and 18 leave the remainder of 5 in each case.
