SOLVER7 Study. Nothing Else.
Chapter 1 - Theorem Q1

Theorem 1.1 (Fundamental Theorem of Arithmetic) : Every composite number can be expressed (factorised) as a product of primes, and this factorisation is unique, apart from the order in which the prime factors occur.

CBSE Class 10 Maths · Real Numbers

Solution

👶 Simple Explanation

Simple Explanation

Think of prime numbers as the basic Lego bricks that cannot be split apart into smaller pieces. Every other number is like a custom toy built from these special bricks. Each and every toy has its own unique recipe of bricks needed to build it. No matter how you choose to take a toy apart, you always get the exact same bricks. This means every number has a single, special combination of building blocks that belongs to it alone.

Answer: The Fundamental Theorem of Arithmetic guarantees that every composite number can be uniquely factorised as a product of prime powers. For example, the unique prime factorisation of \(140\) is \(2^2 \times 5 \times 7\).

📖 Understanding the Fundamental Theorem of Arithmetic

Detailed Explanation

The Fundamental Theorem of Arithmetic is a cornerstone of number theory. It states that any composite number can be broken down into a product of prime numbers in exactly one way, ignoring the order of the factors.

This means prime numbers act as the basic "building blocks" of all integers greater than 1. No matter what method you use to factorise a number (such as a factor tree or continuous division), you will always end up with the exact same prime factors.

Formula Used

Any composite number \( a \) can be uniquely factorised as:

\[a = p_1^{n_1} \times p_2^{n_2} \times \dots \times p_k^{n_k}\]

where:

  • \(p_1, p_2, \dots, p_k\) are prime numbers such that \(p_1 < p_2 < \dots < p_k\)
  • \(n_1, n_2, \dots, n_k\) are positive integers representing the powers of these primes

Solution

Let us illustrate this theorem by finding the unique prime factorisation of the composite number 140:

  1. Step 1: Divide by the smallest prime number, which is \(2\):
    \(140 \div 2 = 70\)
  2. Step 2: Since \(70\) is even, divide by \(2\) again:
    \(70 \div 2 = 35\)
  3. Step 3: \(35\) is not divisible by \(3\). The next prime number is \(5\):
    \(35 \div 5 = 7\)
  4. Step 4: Since \(7\) is a prime number, the process is complete.
  5. Step 5: Express \(140\) as a product of these prime factors:
    \[140 = 2 \times 2 \times 5 \times 7 = 2^2 \times 5^1 \times 7^1\]

This prime factorisation is unique to the number \(140\).

Final Answer

The Fundamental Theorem of Arithmetic ensures that every composite number has a unique prime factorisation. For the number \(140\), the unique prime factorisation is \(2^2 \times 5 \times 7\).

Common Mistake

Including 1 in the prime factorisation: Students sometimes write \(12 = 1 \times 2^2 \times 3\). Remember that 1 is neither prime nor composite. If 1 were considered a prime, the prime factorisation would no longer be unique, as we could write \(1 \times 2^2 \times 3\), \(1^2 \times 2^2 \times 3\), and so on, infinitely.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Start dividing 140 by the smallest prime number, which is 2.
    Reason: Beginning with the smallest prime ensures we build the factorisation in ascending order, as required by the theorem.
    \[140 \div 2 = 70\]
  2. Step 2: Divide the resulting quotient, 70, by 2 again.
    Reason: 70 is still even, so 2 divides it once more. We must exhaust each prime before moving to the next.
    \[70 \div 2 = 35\]
  3. Step 3: Test whether 35 is divisible by 2, then by 3.
    Reason: 35 is odd so 2 does not divide it. Checking divisibility by 3: \(3 + 5 = 8\), which is not a multiple of 3, so 3 does not divide 35 either. We move to the next prime, 5.
  4. Step 4: Divide 35 by 5.
    Reason: Any number ending in 0 or 5 is divisible by 5, and 35 ends in 5.
    \[35 \div 5 = 7\]
  5. Step 5: Identify that the remaining quotient, 7, is a prime number.
    Reason: 7 cannot be divided evenly by any prime less than itself (2, 3, or 5), so it is prime and the process ends here.
  6. Step 6: Write all collected prime factors in index form.
    Reason: Expressing the repeated factor of 2 as a power gives the compact, standard representation demanded by the Fundamental Theorem of Arithmetic.
    \[140 = 2 \times 2 \times 5 \times 7 = 2^2 \times 5 \times 7\]
  7. Step 7: Verify by multiplying the prime powers back.
    Reason: Verification confirms correctness and illustrates the uniqueness guaranteed by the theorem.
    \[2^2 \times 5 \times 7 = 4 \times 5 \times 7 = 20 \times 7 = 140 \checkmark\]

Final Answer

The Fundamental Theorem of Arithmetic guarantees that every composite number can be uniquely factorised as a product of prime powers. For example, the unique prime factorisation of \(140\) is \(2^2 \times 5 \times 7\).

Common Mistake

One common mistake: Students sometimes stop dividing by a prime too early — for instance, dividing 140 by 2 only once and recording \(2 \times 70\) as the final answer. Always continue dividing by the same prime until it no longer divides the quotient evenly, so that every prime factor is captured with its correct power.

✍️ Exam-ready Answer

Exam-ready Answer

\[140 = 2 \times 70\]

\[140 = 2 \times 2 \times 35\]

\[140 = 2 \times 2 \times 5 \times 7\]

\[140 = 2^2 \times 5 \times 7\]

Answer: The Fundamental Theorem of Arithmetic guarantees that every composite number can be uniquely factorised as a product of prime powers. For example, the unique prime factorisation of \(140\) is \(2^2 \times 5 \times 7\).

➕ More Examples

More Examples

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:

  1. Divide by the smallest prime, 2:
    \[3960 \div 2 = 1980\]
  2. \[1980 \div 2 = 990\]
  3. \[990 \div 2 = 495\]
  4. 495 is odd, so try the next prime, 3:
    \[495 \div 3 = 165\]
  5. \[165 \div 3 = 55\]
  6. 55 is not divisible by 3; try 5:
    \[55 \div 5 = 11\]
  7. 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.

🎯 Try a Similar Question

Try a Similar Question

Question: Using the Fundamental Theorem of Arithmetic, find the unique prime factorisation of 360 and express it as a product of prime powers. What does the Fundamental Theorem of Arithmetic guarantee about this factorisation?

Concept

The Fundamental Theorem of Arithmetic states that every composite number can be expressed as a product of primes in a unique way, apart from the order in which the prime factors occur. This means every composite number has exactly one prime factorisation.

Formula Used

\[n = p_1^{a_1} \times p_2^{a_2} \times \cdots \times p_k^{a_k}\]

Solution

  1. Divide by 2 (smallest prime): \(360 \div 2 = 180\)
  2. Divide by 2 again: \(180 \div 2 = 90\)
  3. Divide by 2 again: \(90 \div 2 = 45\)
  4. 45 is not divisible by 2. Try 3: \(45 \div 3 = 15\)
  5. Divide by 3 again: \(15 \div 3 = 5\)
  6. 5 is prime: \(5 \div 5 = 1\)
  7. List all prime factors: \(360 = 2 \times 2 \times 2 \times 3 \times 3 \times 5\)
  8. Write in prime power form:\[360 = 2^3 \times 3^2 \times 5\]
  9. Conclusion: By the Fundamental Theorem of Arithmetic, this is the only way to express 360 as a product of primes (up to order).

Answer: The unique prime factorisation of \(360\) is\[360 = 2^3 \times 3^2 \times 5\] The Fundamental Theorem of Arithmetic guarantees that this factorisation is unique — no other set of prime factors can multiply together to give 360.

Common Mistake: Stopping too early, e.g. writing \(360 = 4 \times 9 \times 10\) instead of breaking all factors down to primes completely.

Everything you get with Solver7

More questions in Real Numbers

30/4/1 2023 / Section A Q1 430/1/1 2026 / Section A Q1 430/2/1 2026 / Section A Q1 430/3/1 2026 / Section A Q1 430/4/1 2026 / Section A Q1 430/5/1 2024 / Section A Q1 Chapter 1 - Theorem Q2 30/3/1 2026 / Section A Q2 430/1/1 2026 / Section A Q2 430/2/1 2026 / Section A Q2 430/3/1 2026 / Section A Q2 CBSE-ADDL1 2024 / Section A Q2 Chapter 1 - Theorem Q3 430/3/1 2026 / Section A Q3 Chapter 1 - Examples Q1 30/2/1 2023 / Section A Q4 30/2/1 2026 / Section A Q4 Chapter 1 - Examples Q2 Chapter 1 - Examples Q3 30/1/1 2026 / Section A Q6 430/5/1 2023 / Section A Q6 Chapter 1 - Examples Q4 430/2/1 2023 / Section A Q7 430/5/1 2024 / Section A Q7 Chapter 1 - Examples Q5 430/5/1 2024 / Section A Q8 Chapter 1 - Examples Q6 30/1/1 2026 / Section A Q9 Chapter 1 - Examples Q7 30/2/1 2026 / Section A Q10 Exercise 1.1 Q1 (i) Exercise 1.1 Q1 (ii) Exercise 1.1 Q1 (iii) 430/4/1 2024 / Section A Q13 Exercise 1.1 Q1 (iv) 30/1/1 2026 / Section A Q14 Exercise 1.1 Q1 (v) Exercise 1.1 Q2 (i) Exercise 1.1 Q2 (ii) Exercise 1.1 Q2 (iii) 30/2/1 2026 / Section A Q18 Exercise 1.1 Q3 (i) 430/1/1 2026 / Section A Q19 430/2/1 2026 / Section A Q19 CBSE-ADDL2 2024 / Section A Q19 Exercise 1.1 Q3 (ii) 30/5/1 2023 / Section A Q20 430/3/1 2024 / Section A Q20 Exercise 1.1 Q3 (iii) 30/2/1 2023 / Section B Q21 30/4/1 2023 / Section B Q21 430/4/1 2024 / Section B Q21 430/4/1 2026 / Section B Q21 430/5/1 2023 / Section B Q21 CBSE-ADDL1 2024 / Section B Q21 CBSE-ADDL2 2024 / Section B Q21 Exercise 1.1 Q4 430/2/1 2023 / Section B Q22(a) Exercise 1.1 Q5 30/3/1 2026 / Section B Q23(a)