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?
उत्तर
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.
संबंधित प्रश्न
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?
Find the LCM:
12, 15
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 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?
The LCM of 12, 15, 20, 27 is
The HCF of two number is 15 and their product is 1650. Find their LCM.
Find the LCM set of numbers using prime factorisation method.
8, 12
Find the LCM set of numbers using prime factorisation method.
15, 25, 75
Find first three common multiples of the given number.
12, 9
Find L.C.M of the given number.
16 and 24