This Lesson (Light flashes on a Christmas tree and a Least Common Multiple) was created by by ikleyn(52906)  : View Source, ShowAbout ikleyn:
Light flashes on a Christmas tree and a Least Common Multiple
Problem 1On a Christmas tree, a first set of lights flashes every 3 seconds, a second set of lights flashes every 4 seconds,
and a third set of lights flashes every 10 seconds. If the lights all came on at 10:00 am, at what time will they all come on together again?
Solution
Find the least common multiple of 3, 4, 10.
Prime factor
3: 3
4: 2*2
10: 2*5
LCM = 3*2*2*5 = 60 seconds. All light flash on at 10:01.
At that time, 1st set flashes 20 times, the 2nd set flashes 15 times, the 3rd set flashes 6 times.
Problem 2School starts at 8:00 AM. A bell rings every 60 minutes, and another bell rings every 48 minutes.
If both bells ring at the start of the day, how many minutes will it be before they ring at the same time again?
Solution
You should find the Least Common Multiple of the numbers 60 and 48.
60 = 12*5; 48 = 12*4; therefore, LCM(60,48) = 12*4*5 = 240.
ANSWER. The two bells ring simultaneously every 240 minutes, i.e. every 4 hours.
Problem 3Two truckers leave Miami at the same time. They take 14 and 6 days, respectively,
to reach their destination and return to Miami. The truckers each take continuous trips to and from Miami.
How many days will pass before the two truckers leave Miami on the same day again?
Solution
It is about finding the Least Common Multiple LCM of the numbers 14 and 6.
To find LCM, you use prime decomposition of the two numbers, 14 and 6
14 = 2*7; 6 = 2*3.
Then you take all participating prime numbers, 2, 3 and 7, and raise each prime to the maximum participating degree.
Doing this way, you get factors 2, 3 and 7.
To get LCM, you multiply these factors: 2*3*7 = 42.
LCM(14,6) = 7*2*3 = 42.
ANSWER. In 42 days.
Problem 4Three friends are packing sweets into gift boxes. They agree that each box should contain the same number of sweets,
but they are each working in separate locations with their own pile of sweets so cannot share boxes.
Gwen has 286 sweets, Bill has 390 sweets and Ariel has 468 sweets.
If they put the largest number of sweets into each box that they can and they use up all their sweets, how many boxes of sweets will they pack?
Solution
This problem is to find the Greatest Common Divisor (GCD) of the numbers 286, 390 and 468.
These numbers have common prime divisors 13 and 2 and have no other common prime divisors.
So, their greatest common divisor is 13*2 = 26.
THEREFORE, the three friends should put 26 sweets into each box.
Doing this way, they will fill = 44 boxes. ANSWER
My other lessons in this site on miscellaneous problems on divisibility of integer numbers are
- The number that leaves a remainder 1 when divided by 2, by 3, by 4, by 5 and so on until 9
- The number which gives remainder 4 when divided by 7, remainder 5 when divided by 8 and remainder 6 when divided by 9
- Introductory problems on divisibility of integer numbers
- Finding Greatest Common Divisor of integer numbers
- Relatively prime numbers help to solve the problem
- Solving equations in integer numbers
- Quadratic polynomial with odd integer coefficients can not have a rational root
- Proving an equation has no integer solutions
- Composite number of the form (4n+3) must have a prime divisor of the form (4n+3)
- Problems on divisors of a given number
- How many three-digit numbers are multiples of both 5 and 7?
- How many 3-digit numbers are not divisible by 2; not divisible by 3; not divisible by either 2 or 3
- How many integer numbers in the range 1-300 are divisible by at least one of the integers 4, 6 and 15 ?
- Find the remainder of division
- Why 3^n + 7^n - 2 is divisible by 8 for all positive integer n ?
- What is the last digit of the number a^n ?
- Find the last three digits of these numbers
- Find the last two digits of the number 3^123 + 7^123 + 9^123
- Find the last two digits of (1! + 2! + 3! + ... + 2024!)^2024
- Find n-th term of a sequence
- Solving Diophantine equations
- How many integers of the form n^2 + 18n + 13 are perfect squares
- Miscellaneous problems on divisibility numbers
- Find the sum of digits of integer numbers
- Two-digit numbers with digit "9"
- Find a triangle with integer side lengths and integer area
- Math circle level problem on the hundred-handed monster Briareus
- Math Circle level problem on lockers and divisors of integer numbers
- Nice entertainment problems related to divisibility property
- Solving problems on modular arithmetic
- Using the little Fermat's theorem to solve a problem on modular arithmetic
- OVERVIEW of miscellaneous solved problems on divisibility of integer numbers
This lesson has been accessed 2270 times.
|