Given an integer N, the task is to find the smallest power of four greater than or equal to N.
Input: N = 12
24 = 16 which is the next required
greater number after 12.
Input: N = 81
- Find the fourth root of the given n.
- Calculate its floor value using floor() function.
- If n is itself a power of four then return n.
- Else add 1 to the floor value.
- Return the fourth power of that number.
Below is the implementation of the above approach:
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.
- Smallest power of 2 greater than or equal to n
- Highest and Smallest power of K less than and greater than equal to N respectively
- Smallest number greater than n that can be represented as a sum of distinct power of k
- Smallest number greater than or equal to N using only digits 1 to K
- Smallest number greater than or equal to N divisible by K
- Smallest number greater than Y with sum of digits equal to X
- Smallest subarray from a given Array with sum greater than or equal to K
- Smallest number greater than or equal to X whose sum of digits is divisible by Y
- Smallest Special Prime which is greater than or equal to a given number
- Minimum element whose n-th power is greater than product of an array of size n
- Smallest N digit number which is a perfect fourth power
- Smallest divisor D of N such that gcd(D, M) is greater than 1
- Highest power of 2 less than or equal to given Integer
- Highest power of 2 less than or equal to given number
- Length of Smallest subarray in range 1 to N with sum greater than a given value
- Smallest number greater or equals to N such that it has no odd positioned bit set
- Minimum number of power terms with sum equal to n
- Smallest integer greater than n such that it consists of digit m exactly k times
- Find two numbers whose difference of fourth power is equal to N
- Longest subarray having average greater than or equal to x
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.