Advertisements
Advertisements
Question
The traffic lights at three different road junctions change after every 40 seconds, 60 seconds and 72 seconds respectively. If they changed simultaneously together at 8 a.m at the junctions, at what time will they simultaneously change together again?
Advertisements
Solution
This is an LCM related problem
Finding the LCM of 40, 60 and 72
60 seconds = 1 min
360 min = 6 min
| 2 | 40, 60, 72 |
| 2 | 20, 30, 36 |
| 3 | 10, 15, 18 |
| 5 | 10, 5, 6 |
| 2 | 2, 1, 6 |
| 3 | 1, 1, 3 |
| 1, 1, 1 |
LCM (40, 60, 72) = 2 × 2 × 3 × 5 × 2 × 3 = 360
After 360 seconds they will change again i.e after six minutes they will change again i.e at 8.06 am they will change again simultaneously.
APPEARS IN
RELATED QUESTIONS
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 HCF and LCM:
14, 28
Find the HCF and LCM:
17, 102, 170
Find the LCM:
36, 42
Find the smallest number which when divided by 8, 9, 10, 15, or 20 gives a remainder of 5 every time.
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 12, 16, 24 and 36 leaves a remainder 7 in each case.
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
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?
