A magic number is defined as a number which can be expressed as a power of 5 or sum of unique powers of 5. First few magic numbers are 5, 25, 30(5 + 25), 125, 130(125 + 5), ….
Write a function to find the nth Magic number.
Input: n = 2 Output: 25 Input: n = 5 Output: 130
If we notice carefully the magic numbers can be represented as 001, 010, 011, 100, 101, 110 etc, where 001 is 0*pow(5,3) + 0*pow(5,2) + 1*pow(5,1). So basically we need to add powers of 5 for each bit set in given integer n.
Below is the implementation based on this idea.
nth magic number is 130
Thanks to manrajsingh for suggesting above solution.
This article is contributed by Abhay. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Check if a number is magic (Recursive sum of digits is 1)
- Magic Square
- Find minimum number to be divided to make a number a perfect square
- The Magic of Fibonacci Numbers
- Josephus Problem Using Bit Magic
- Magic Square | Even Order
- Find a number which give minimum sum when XOR with every number of array of integers
- Given number of matches played, find number of teams in tournament
- Count Magic squares in a grid
- Find the total number of composite factor for a given number
- Find the largest good number in the divisors of given number N
- Find the maximum number of composite summands of a number
- Find the number of ways to divide number into four parts such that a = c and b = d
- Find count of digits in a number that divide the number
- Find the smallest number whose digits multiply to a given number n