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 the LCM:
18, 42, 48
Find the LCM of the numbers given below:
42, 63
Find the LCM of the numbers given below:
48, 64, 72, 96, 108
Find the least number which when divided by 12, 16, 24 and 36 leaves a remainder 7 in each case.
Find the LCM set of numbers using prime factorisation method.
15, 25, 75
Find the smallest number which is exactly divisible by all the numbers from 1 to 9
The numbers which divides 35 without remainders are _______, ________, ________
Find L.C.M of the given number.
16 and 24
There is a garden in Anu’s house. In the middle of the garden there is a path. They decided to tile the path using tiles of length 2 feet, 3 feet and 5 feet.
The mason tiled the first row with 2 feet tiles, the second row with 3 feet tiles and the third row with 5 feet tiles. The mason has not cut any of the tiles. Then what is the shortest length of the path?
The smallest number that is a multiple of both 3 and 7 is:
