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
CBSE Class 10 Maths · Real Numbers
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.
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.
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\)
\(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.
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.
\(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.
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.
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.
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.
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.
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.
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.