Problems on H.C.F and L.C.M
An electronic device makes a beep after every 60 sec. Another device makes a beep after every 62 sec. They beeped together at 10 a.m. The time when they will next make a beep together at the earliest,
L.C.M. of 60 and 62 seconds is 1860 seconds1860/60 = 31 minutesThey will beep together at 10:31 a.m.Sometimes questions on red lights blinking comes in exam, which can be solved in the same way
Converting given measurements into centimeters 4m 96 cm = 400+96 = 496 cm 4m 3cm = 400+3 =403 cmTo find the side of the largest possible brick , the side of brick must divide length as well as breadth exactly. Using division method 403)496(1 403 93) 403 (4 370 31) 93 (3 93 0HCF = 31 Side of the largest possible square brick =31cm
The greatest number that will divide 172,205 and 304 leaving the same remainder in each case is HCF ((205-172), (304-205), (304-172)) = HCF of 33, 99, and 132 33=31x11 99=3 x 3 x 11 132=3 x 2 x 2 x11 Required number =3 x 11=33