SOLVER7 Study. Nothing Else.
2026 Board Paper Q21

Show that \(45^n\) can not end with the digit 0, \(n\) being a natural number. Write the prime number \('a'\) which on multiplying with \(45^n \) makes the product end with the digit 0.

CBSE Class 10 Maths · Real Numbers

Solution

👶 Simple Explanation

Simple Explanation

Imagine a number can only end in zero if it has both a '2' and a '5' hidden inside it as building blocks. Think of it like a lock needing two keys. Now, \(45^n\) is built only from the building blocks 3 and 5 — the building block 2 is totally missing. Without that missing key, the lock never opens, so \(45^n\) can never end in zero. To fix this, you simply multiply by the prime number 2, and then both keys are present.

Answer: \(45^n = 3^{2n} \times 5^n\) has no factor of 2 in its prime factorisation, so it is never divisible by 10 and therefore can never end with the digit 0 for any natural number n.
The prime number \(a = 2\) must be multiplied with \(45^n\) to make the product end with the digit 0, because \(2 \times 45^n\) then contains both the prime factors 2 and 5, making it divisible by 10.

📖 Why 45ⁿ Cannot End With Digit 0

Detailed Explanation

A number ends with the digit 0 only if it is divisible by 10. Since \(10 = 2 \times 5\), a number ends in 0 if and only if its prime factorisation contains BOTH the prime factor 2 AND the prime factor 5. To check whether \(45^n\) can end in 0, we first write 45 as a product of its prime factors. If the prime factorisation of \(45^n\) is missing either 2 or 5, then \(45^n\) cannot be divisible by 10 and therefore cannot end in 0. This idea comes from the Fundamental Theorem of Arithmetic, which states that every natural number has a unique prime factorisation.

Formula Used

A number ends in 0 \(\Leftrightarrow\) it is divisible by 10 \(\Leftrightarrow\) its prime factorisation contains both 2 and 5.
Prime factorisation of 45: \(45 = 3^2 \times 5\)
So: \(45^n = (3^2 \times 5)^n = 3^{2n} \times 5^n\)

Solution

  1. Step 1: Prime Factorise 45: We divide 45 by its smallest prime factors: 45 ÷ 3 = 15, then 15 ÷ 3 = 5, then 5 ÷ 5 = 1.
    So the prime factorisation of 45 is \[45 = 3^2 \times 5\]
  2. Step 2: Write the Prime Factorisation of 45ⁿ: Raise both sides to the power n: \[45^n = (3^2 \times 5)^n = 3^{2n} \times 5^n\] This is the complete prime factorisation of \(45^n\) for any natural number n.
  3. Step 3: Check for the Factor 10: For \(45^n\) to end in 0, its prime factorisation must include both 2 and 5 (because \(10 = 2 \times 5\)). Looking at \(3^{2n} \times 5^n\), we can see that the only prime factors present are 3 and 5. The prime factor 2 is completely absent. Since 2 is not a factor of \(45^n\), the number \(45^n\) is NOT divisible by 10.
  4. Step 4: Conclude the Proof: Because \(45^n = 3^{2n} \times 5^n\) contains no factor of 2, it can never be divisible by 10, for any natural number n. Therefore, \(45^n\) can never end with the digit 0.
  5. Step 5: Find the Prime 'a' That Makes the Product End in 0: We need a prime number a such that \(a \times 45^n\) ends in 0, i.e., is divisible by 10. We already know \(45^n = 3^{2n} \times 5^n\), which contains the factor 5 but not 2. So if we multiply by \(a = 2\): \[2 \times 45^n = 2 \times 3^{2n} \times 5^n\] Now the product contains both 2 and 5, making it divisible by \(2 \times 5 = 10\). Hence the product ends in 0. The required prime is \(a = 2\).

Final Answer

\(45^n = 3^{2n} \times 5^n\) has no factor of 2 in its prime factorisation, so it is never divisible by 10 and therefore can never end with the digit 0 for any natural number n.
The prime number \(a = 2\) must be multiplied with \(45^n\) to make the product end with the digit 0, because \(2 \times 45^n\) then contains both the prime factors 2 and 5, making it divisible by 10.

Common Mistake

A common mistake is thinking that because 45 contains the factor 5, it should be able to end in 0 or 5 after raising to a power. Remember: ending in 0 specifically requires BOTH 2 AND 5 as prime factors. Just having 5 is not enough — the factor 2 must also be present.

🪜 Step-by-step Solution

Step-by-step Solution

  1. Step 1: Find the prime factorisation of 45: Divide 45 by its smallest prime factor: \(45 \div 3 = 15\). Then divide again: \(15 \div 3 = 5\). Finally: \(5 \div 5 = 1\). Writing this as a product of primes: \[45 = 3^2 \times 5\] — Reason: Breaking 45 into prime factors lets us apply the Fundamental Theorem of Arithmetic, which guarantees a unique prime factorisation for every natural number.
  2. Step 2: Raise both sides to the power n: Using index laws, raise each prime factor to the power n: \[45^n = (3^2 \times 5)^n = 3^{2n} \times 5^n\] — Reason: This gives us the complete and unique prime factorisation of \(45^n\) for any natural number \(n\), so we can clearly see every prime factor present.
  3. Step 3: Identify which prime factors are present: Looking at \(3^{2n} \times 5^n\), the only primes that appear are 3 and 5. The prime factor 2 is completely absent from this expression for every value of \(n\). — Reason: We need to check whether both 2 and 5 appear, because a number divisible by 10 must contain both as prime factors.
  4. Step 4: Apply the divisibility-by-10 condition: Since \(10 = 2 \times 5\), a number ends in 0 only if its prime factorisation includes at least one factor of 2 AND at least one factor of 5. The factorisation \(3^{2n} \times 5^n\) contains 5 but never contains 2. — Reason: Without the factor 2, the number cannot be divisible by 10, so it cannot end in 0.
  5. Step 5: Conclude and find the prime number a: Because 2 is missing from the prime factorisation of \(45^n\), it can never end in 0. To make the product end in 0, we must introduce a factor of 2. Multiplying by the prime \(a = 2\) gives \(2 \times 45^n = 2 \times 3^{2n} \times 5^n\), which now contains both prime factors 2 and 5, making it divisible by 10. — Reason: Introducing exactly the missing prime factor 2 is the minimal change needed to produce a number ending in 0.

Final Answer

\(45^n = 3^{2n} \times 5^n\) has no factor of 2 in its prime factorisation, so it is never divisible by 10 and therefore can never end with the digit 0 for any natural number n.
The prime number \(a = 2\) must be multiplied with \(45^n\) to make the product end with the digit 0, because \(2 \times 45^n\) then contains both the prime factors 2 and 5, making it divisible by 10.

Common Mistake

One common mistake: Students sometimes check only whether 5 is a factor of \(45^n\) and conclude it can end in 0, forgetting that BOTH 2 and 5 must be present in the prime factorisation for a number to be divisible by 10.

✍️ Exam-ready Answer

Exam-ready Answer

  1. Step 1: Prime factorise 45: \[45 = 3^2 \times 5\]
  2. Step 2: Prime factorisation of \(45^n\): \[45^n = (3^2 \times 5)^n = 3^{2n} \times 5^n\]
  3. Step 3: Check for factor 2: Prime factors of \(45^n\) are 3 and 5 only — the factor 2 is absent. Since \(10 = 2 \times 5\) requires both 2 and 5, \(45^n\) is never divisible by 10.

Answer: \(45^n = 3^{2n} \times 5^n\) has no factor of 2 in its prime factorisation, so it is never divisible by 10 and therefore can never end with the digit 0 for any natural number n.
The prime number \(a = 2\) must be multiplied with \(45^n\) to make the product end with the digit 0, because \(2 \times 45^n\) then contains both the prime factors 2 and 5, making it divisible by 10.

➕ More Examples

More Examples

Example 1

Question: Show that \( 28^n \) cannot end with the digit 0 for any natural number \( n \). Also write the prime number \( p \) which, when multiplied with \( 28^n \), makes the product end with the digit 0.

Solution: Step 1: Write the prime factorisation of 28. \[ 28 = 2^2 \times 7 \] Therefore, \[ 28^n = (2^2 \times 7)^n = 2^{2n} \times 7^n \] Step 2: For a number to end with digit 0, it must be divisible by 10. Since \[ 10 = 2 \times 5 \] the number must contain both 2 and 5 as prime factors. Step 3: The prime factorisation of \( 28^n \) contains only the primes 2 and 7. The prime factor 5 is completely absent from \( 28^n \) for any natural number \( n \). Step 4: Since 5 never divides \( 28^n \), the number \( 28^n \) is never divisible by 10, and therefore can never end with the digit 0. Step 5: To make the product end with 0, we need to introduce the missing prime factor 5. Consider \( 5 \times 28^n \): \[ 5 \times 28^n = 5 \times 2^{2n} \times 7^n \] This now contains both 2 and 5 as factors, so it is divisible by 10 and ends in 0. Hence, the required prime number is \( p = 5 \).

Answer: \( 28^n \) cannot end in 0 because its prime factorisation \( 2^{2n} \times 7^n \) never contains the factor 5. The prime number \( p = 5 \) must be multiplied to make the product end in 0.

Example 2

Question: Prove that \( 6^n \) cannot end with the digit 0 for any natural number \( n \). State the prime number \( q \) which, when multiplied with \( 6^n \), makes the product end with 0.

Solution: Step 1: Find the prime factorisation of 6. \[ 6 = 2 \times 3 \] Therefore, \[ 6^n = (2 \times 3)^n = 2^n \times 3^n \] Step 2: A number ends with digit 0 if and only if 10 divides it. Since \[ 10 = 2 \times 5 \] both the primes 2 and 5 must appear in its prime factorisation. Step 3: The prime factorisation of \( 6^n \) is \( 2^n \times 3^n \), which contains only the primes 2 and 3. The prime 5 does not appear as a factor of \( 6^n \) for any natural number \( n \). Step 4: By the Fundamental Theorem of Arithmetic, the prime factorisation of a number is unique. Since 5 never appears in the factorisation of \( 6^n \), the number \( 6^n \) is never divisible by 5, and hence never divisible by 10. Therefore \( 6^n \) cannot end with the digit 0. Step 5: Multiplying \( 6^n \) by 5 gives: \[ 5 \times 6^n = 5 \times 2^n \times 3^n \] This product now contains both primes 2 and 5, making it divisible by \( 2 \times 5 = 10 \), so it ends in 0. Hence, the required prime number is \( q = 5 \).

Answer: \( 6^n \) cannot end in 0 because its prime factorisation \( 2^n \times 3^n \) never contains the factor 5. The prime number \( q = 5 \) must be multiplied to make the product end in 0.

🎯 Try a Similar Question

Try a Similar Question

Question: Show that \( 63^n \) can never end with the digit 0, where \( n \) is a natural number. Also, state the prime number \( p \) which, when multiplied with \( 63^n \), makes the product end with the digit 0.

Solution

  1. Step 1: Prime Factorise 63: Write 63 as a product of prime factors. We have \( 63 = 9 \times 7 = 3^2 \times 7 \). Therefore, \[ 63^n = (3^2 \times 7)^n = 3^{2n} \times 7^n. \]
  2. Step 2: Check for Factors of 2 and 5: For a number to end with the digit 0, its prime factorisation must contain both the prime 2 and the prime 5. The prime factorisation \( 3^{2n} \times 7^n \) contains only the primes 3 and 7. It contains neither the factor 2 nor the factor 5.
  3. Step 3: Conclude that 63^n never ends in 0: Since \( 63^n = 3^{2n} \times 7^n \) has no factor of 2 and no factor of 5 in its prime factorisation, it cannot be divisible by 10. Therefore, \( 63^n \) can never end with the digit 0 for any natural number \( n \).
  4. Step 4: Find the prime p that makes the product end in 0: To make \( p \times 63^n \) end with 0, the product must be divisible by 10, i.e., it must contain both the prime factor 2 and the prime factor 5. Since \( 63^n = 3^{2n} \times 7^n \) already contains neither 2 nor 5, we need to introduce both. However, since we multiply by a single prime \( p \), we can supply only one of the two missing primes. Multiplying by \( p = 2 \) gives \[ 2 \times 63^n = 2 \times 3^{2n} \times 7^n, \] which still lacks a factor of 5 and does not end in 0. Multiplying by \( p = 5 \) gives \[ 5 \times 63^n = 5 \times 3^{2n} \times 7^n, \] which still lacks a factor of 2 and does not end in 0. Therefore, no single prime multiplication can make \( 63^n \) end in 0, because both factors 2 and 5 are missing. The smallest set of primes needed is \( \{2, 5\} \); multiplying by \( 2 \times 5 = 10 \) (i.e., both primes) yields \[ 10 \times 63^n = 2 \times 5 \times 3^{2n} \times 7^n, \] which ends in 0.

Answer: \( 63^n = 3^{2n} \times 7^n \) contains neither the prime factor 2 nor the prime factor 5, so it is never divisible by 10 and can never end with the digit 0 for any natural number \( n \). Unlike \( 45^n \) (which has a factor of 5 and only needs 2), \( 63^n \) is missing both 2 and 5, so no single prime \( p \) alone can make \( p \times 63^n \) end in 0; both primes 2 and 5 must be introduced.

Everything you get with Solver7

More questions in Real Numbers

Chapter 1 - Theorem Q1 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/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)