LCM \[= 2 × 2 × 3 × 5 × 3 × 4\]
\[ = 720\]
The traffic lights at three different road crossings change after \[24\] seconds, \[36\] seconds and \[54\] seconds respectively. If they all change simultaneously at \[10 : 15 : 00\] AM, then at what time will they again change simultaneously?
LCM of \[24, 36\] and \[54\] seconds
\[= 216\] seconds
\[= 3\] minutes \[36\] seconds
\[\therefore\] Required time
\[= 10 : 15 : 00 + 3\] minutes \[36\] seconds
\[= 10 : 18 : 36\] a.m.
The greatest number of five digits is \[99999\].
LCM of \[3, 5, 8\] and \[12\].
LCM \[= 2 × 2 × 3 × 5 × 2 = 120\]
After dividing \[99999\] by \[120\], we get \[39\] as remainder
\[99999 – 39 = 99960\]
\[= (833 × 120) = 99960\]
\[99960\] is the greatest five digit number divisible by the given divisors.
In order to get \[2\] as remainder in each case we will simply add \[2\] to \[99960\].
\[\therefore\] Greatest number
\[= 99960 + 2\]
\[= 99962\]
HCF \[= 12\]
Numbers \[= 12 x\] and \[12 y\]
where \[x\] and \[y\] are prime to each other.
\[\therefore 12 x \times 12 y = 2160\]
\[\Rightarrow xy=\frac{2160}{12\times12}\]
\[=15 = 3 × 5, 1 × 15\]
Possible pairs \[= (36, 60)\] and \[(12, 180)\]
Maximum number of students
\[=\] The greatest common divisor
\[=\] HCF of \[1001\] and \[910\]
\[=91\]
84 Maths books, 90 Physics books and 120 Chemistry books have to be stacked topicwise. How many books will be there in each stack so that each stack will have the same height too ?
As the height of each stack is same, the required number of books in each stack
\[=\] HCF of \[84, 90\] and \[120 \]
\[84 = 2 × 2 × 3 × 7\]
\[90 = 2 × 3 × 3 × 5\]
\[120 = 2 × 2 × 2 × 3 × 5\]
HCF \[ = 2 × 3 = 6\]
Suppose the numbers are \[4x\] and \[5x\] respectively
According to question
\[x × 4 × 5 = 120\]
\[x = 6\]
Required numbers
\[= 4 × 6 = 24\]
and
\[5 × 6 = 30\]
Let the numbers be \[x\] and \[( x + 2)\].
Product of numbers \[= HCF × LCM \]
\[\implies x ( x + 2) = 24 \]
\[\implies x^2 + 2 x – 24=0 \]
\[\implies x^2 + 6 x – 4 x – 24=0 \]
\[\implies x ( x + 6) – 4 ( x + 6)=0 \]
\[\implies ( x – 4) ( x + 6)=0 \]
\[\implies x = 4\], as \[x \neq – 6=0 \]
Numbers are \[4\] and \[6\].
Take the HCF of :
And, HCF of \[6\] and \[48\] is also \[6\].
So, the required greatest number will be \[6\].