- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# Show that $12^n$ cannot end with the digit 0 or 5 for any natural number $n$.

To find:

We have to show that $12^n$ cannot end with the digit 0 or 5 for any natural number $n$.

Solution:

We know that,

If a number ends with the digit 0 or 5, it is always divisible by 5.

This implies,

If $12^n$ ends with the digit zero it must be divisible by 5.

This is possible only if the prime factorisation of $12^n$ contains the prime number 5.

Prime factorisation of 12 is,

$12=2\times2\times3$

$\Rightarrow 12^n=(2\times2\times3)^n$

$=2^{2n}\times3^n$

The prime factorisation of $12^n$ does not contain the prime number 5.

Therefore, $12^n$ cannot end with the digit 0 or 5 for any natural number $n$.

- Related Questions & Answers
- JavaScript - Find the smallest n digit number or greater
- n-th number with digits in {0, 1, 2, 3, 4, 5} in C++
- Largest number less than N with digit sum greater than the digit sum of N in C++
- Find value of (n^1 + n^2 + n^3 + n^4) mod 5 for given n in C++
- Count divisors of n that have at-least one digit common with n in Java
- Construct Pushdown automata for L = {0(n+m)1m2n | m, n = 0} in C++
- N digit numbers divisible by 5 formed from the M digits in C++
- Find (1^n + 2^n + 3^n + 4^n) mod 5 in C++
- Number of n digit stepping numbers in C++
- Maximum path sum that starting with any cell of 0-th row and ending with any cell of (N-1)-th row in C++
- C Program for the cube sum of first n natural numbers?
- Largest number with the given set of N digits that is divisible by 2, 3 and 5 in C++
- Construct Pushdown automata for L = {0n1m2(n+m) | m,n = 0} in C++
- Sum of the numbers up to N that are divisible by 2 or 5 in c programming
- Convert a number of length N such that it contains any one digit at least 'K' times in C++
- Count of all N digit numbers such that num + Rev(num) = 10^N - 1 in C++

Advertisements