Advertisements
Advertisements
प्रश्न
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
उत्तर
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.
संबंधित प्रश्न
Find the LCM:
105, 195
Find the HCF and LCM of the numbers given below. Verify that their product is equal to the product of the given numbers.
32, 37
The LCM and HCF of two numbers are 432 and 72 respectively. If one of the numbers is 216, what is the other?
The product of two two-digit numbers is 765 and their HCF is 3. What is their LCM?
Find the LCM of the numbers given below:
42, 63
The circumferences of four wheels are 50 cm, 60 cm, 75 cm, and 100 cm. They start moving simultaneously. What least distance should they cover so that each wheel makes a complete number of revolutions?
Find the least number which when divided by 16, 36, and 40 leaves 5 as the remainder in each case.
The number divisible by 5 with no remainder
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 LCM of 2 and 5 is:
