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:
15, 30, 90
The HCF of this pair of numbers is not 1.
Find the HCF and LCM:
23, 69
Find the LCM of the numbers given below:
36, 40, 126
The HCF of two number is 15 and their product is 1650. Find their LCM.
Find the least number which when divided by 16, 36, and 40 leaves 5 as the remainder in each case.
Find the LCM set of numbers using prime factorisation method.
8, 12
Find first three common multiples of the given number.
24, 16
Find L.C.M of the given number.
30 and 20
Find the least number which when divided by 6, 15 and 18 leave the remainder of 5 in each case.
