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.
संबंधित प्रश्न
An equal number of laddoos have been placed in 3 different boxes. The laddoos in the first box were distributed among 20 children equally, the laddoos in the second box among 24 children, and those in the third box among 12 children. Not a single laddoo was leftover. Then, what was the minimum number of laddoos in the three boxes altogether?
Find the LCM:
45, 86
Find the LCM:
15, 30, 90
Find the LCM:
105, 195
Find the LCM:
24, 40, 80, 120
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?
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?
Wilson, Mathan and Guna can complete one round of a circular track in 10, 15 and 20 minutes respectively. If they start together at 7 a.m from the starting point, at what time will they meet together again at the starting point?
Determine the greatest 3-digit number exactly divisible by 8, 10 and 12.
