Smallest power of 4 greater than or equal to N
Given an integer N, the task is to find the smallest power of four greater than or equal to N.
Examples:
Input: N = 12
Output: 16
24 = 16 which is the next required
greater number after 12.
Input: N = 81
Output: 81
Approach:
- 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:
C++
// C++ implementation of above approach #include <bits/stdc++.h> using namespace std; // Function to return the smallest power // of 4 greater than or equal to n int nextPowerOfFour(int n) { int x = floor(sqrt(sqrt(n))); // If n is itself is a power of 4 // then return n if (pow(x, 4) == n) return n; else { x = x + 1; return pow(x, 4); } } // Driver code int main() { int n = 122; cout << nextPowerOfFour(n); return 0; } |
chevron_right
filter_none
Java
// Java implementation of above approach import java.util.*; import java.lang.Math; import java.io.*; class GFG { // Function to return the smallest power // of 4 greater than or equal to n static int nextPowerOfFour(int n) { int x = (int)Math.floor(Math.sqrt(Math.sqrt(n))); // If n is itself is a power of 4 // then return n if (Math.pow(x, 4) == n) return n; else { x = x + 1; return (int)Math.pow(x, 4); } } // Driver code public static void main (String[] args) throws java.lang.Exception { int n = 122; System.out.println(nextPowerOfFour(n)); } } // This code is contributed by nidhiva |
chevron_right
filter_none
Python3
# Python implementation of above approach import math # Function to return the smallest power # of 4 greater than or equal to n def nextPowerOfFour(n): x = math.floor((n**(1/2))**(1/2)); # If n is itself is a power of 4 # then return n if ((x**4) == n): return n; else: x = x + 1; return (x**4); # Driver code n = 122; print(nextPowerOfFour(n)); # This code is contributed by Rajput-Ji |
chevron_right
filter_none
C#
// C# implementation of above approach using System; class GFG { // Function to return the smallest power // of 4 greater than or equal to n static int nextPowerOfFour(int n) { int x = (int)Math.Floor(Math.Sqrt(Math.Sqrt(n))); // If n is itself is a power of 4 // then return n if (Math.Pow(x, 4) == n) return n; else { x = x + 1; return (int)Math.Pow(x, 4); } } // Driver code public static void Main () { int n = 122; Console.WriteLine(nextPowerOfFour(n)); } } // This code is contributed by anuj_67.. |
chevron_right
filter_none
Output:
256
GeeksforGeeks has prepared a complete interview preparation course with premium videos, theory, practice problems, TA support and many more features. Please refer Placement 100 for details
Recommended Posts:
- 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 divisible by 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
- 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
- Highest power of 2 less than or equal to given number
- Highest power of 2 less than or equal to given Integer
- Smallest integer greater than n such that it consists of digit m exactly k times
- Minimum number of power terms with sum equal to n
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.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.
- Number of ways to obtain each numbers in range [1, b+c] by adding any two numbers in range [a, b] and [b, c]
- Count of subarrays of size K which is a permutation of numbers from 1 to K
- Count of triplets of numbers 1 to N such that middle element is always largest
- Minimum LCM of all pairs in a given array
- Count subarrays with sum equal to its XOR value
- Sum of all subsequences of length K
- Minimum area of square holding two identical rectangles
- Count numbers from range whose prime factors are only 2 and 3 using Arrays | Set 2
- Minimum circular rotations to obtain a given numeric string by avoiding a set of given strings
- Last digit of sum of numbers in the given range in the Fibonacci series