Let n be any power raised to base 2 i.e 2n. We are given the number n and our task is to find out the number of digits contained in the number 2n.
Input : n = 5 Output : 2 Explanation : 2n = 32, which has only 2 digits. Input : n = 10 Output : 4 Explanation : 2n = 1024, which has only 4 digits.
We can write 2n using logarithms as:
2n = 10nlog102
Now suppose, x = nlog102,
Therefore, 2n = 10x
Also, we all know that the number, 10n will have (n+1) digits. Therefore, 10x will have (x+1) digits.
Or, we can say that 2n will have (x+1) digits as 2n = 10x.
Therefore, number of digits in 2n = (nlog102) + 1
Below is the implementation of above idea:
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Larger of a^b or b^a (a raised to power b or b raised to power a)
- Find the sum of power of bit count raised to the power B
- Find last five digits of a given five digit number raised to power five
- Print last k digits of a^b (a raised to power b)
- GCD of a number raised to some power and another number
- Check if a number can be expressed as x^y (x raised to power y)
- Minimum removals in a number to be divisible by 10 power raised to K
- Find multiple of x closest to or a ^ b (a raised to power b)
- Find unit digit of x raised to power y
- K-th digit in 'a' raised to power 'b'
- Find value of y mod (2 raised to power x)
- Sum of absolute difference of all pairs raised to power K
- Last digit of a number raised to last digit of N factorial
- Check if given number is a power of d where d is a power of 2
- Sum of each element raised to (prime-1) % prime
- Numbers of Length N having digits A and B and whose sum of digits contain only digits A and B
- Minimum digits to be removed to make either all digits or alternating digits same
- Find power of power under mod of a prime
- Compute power of power k times % m
- Sum of digits of a given number to a given power
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.