Example 1
Question: Express 3,960 as a product of its prime factors and verify that the factorisation is unique (as guaranteed by the Fundamental Theorem of Arithmetic).
Solution:
- Divide by the smallest prime, 2:
\[3960 \div 2 = 1980\] - \[1980 \div 2 = 990\]
- \[990 \div 2 = 495\]
- 495 is odd, so try the next prime, 3:
\[495 \div 3 = 165\] - \[165 \div 3 = 55\]
- 55 is not divisible by 3; try 5:
\[55 \div 5 = 11\] - 11 is itself a prime number. Stop here.
Collecting all prime factors:
\[3960 = 2^3 \times 3^2 \times 5 \times 11\]
By the Fundamental Theorem of Arithmetic, every composite number has one and only one prime factorisation (order of factors apart). No matter which prime you start dividing by, you will always arrive at exactly \(2^3 \times 3^2 \times 5 \times 11\).
Answer:\[3960 = 2^3 \times 3^2 \times 5 \times 11\] This factorisation is unique.
Example 2
Question: Two bells in a clock tower ring at regular intervals. Bell A rings every 84 minutes and Bell B rings every 90 minutes. Both bells ring together at 8:00 AM. Using prime factorisation, find the next time they will ring together.
Solution:
We need to find the LCM of 84 and 90 using prime factorisation (which is valid because of the Fundamental Theorem of Arithmetic — each number has a unique prime factorisation).
Step 1 — Prime factorise 84:
\[84 = 2 \times 42 = 2 \times 2 \times 21 = 2^2 \times 3 \times 7\]
Step 2 — Prime factorise 90:
\[90 = 2 \times 45 = 2 \times 3 \times 15 = 2 \times 3 \times 3 \times 5 = 2 \times 3^2 \times 5\]
Step 3 — Find the LCM by taking the highest power of every prime that appears:
\[\text{LCM}(84,\,90) = 2^2 \times 3^2 \times 5 \times 7\]
\[= 4 \times 9 \times 5 \times 7 = 1260 \text{ minutes}\]
Step 4 — Convert to hours:
\[1260 \div 60 = 21 \text{ hours}\]
So the bells will next ring together 21 hours after 8:00 AM, i.e., at 5:00 AM the next day.
Answer: The two bells ring together again after \(1260\) minutes (21 hours), i.e., at 5:00 AM the next day.