## Check if a large number is divisible by a number which is a power of 2

Given a large number in the form of a string str and a number K, the task is to check if the number formed by… Read More »

- Largest number in the Array having frequency same as value
- Distinct powers of a number N such that the sum is equal to K
- Largest value of x such that ax
^{x}is N-digit number of base b - Count numbers from range whose prime factors are only 2 and 3 using Arrays | Set 2
- Minimum steps to reach the Nth stair in jumps of perfect power of 2
- Highest power of 2 less than or equal to given Integer
- Curzon Numbers
- Pair of integers having difference of their fifth power as X
- Find two numbers whose difference of fourth power is equal to N
- Probability that an arbitrary positive divisor of 10^X is an integral multiple of 10^Y
- Split N powers of 2 into two subsets such that their difference of sum is minimum
- Length of largest subarray whose all elements Powerful number
- Check if the number is a Prime power number
- Last digit in a power of 2
- Elements of Array which can be expressed as power of some integer to given exponent K
- Elements of Array which can be expressed as power of prime numbers
- Last digit of a number raised to last digit of N factorial
- Count of elements which are power of 2 in a given range subarray for Q queries
- Highest and Smallest power of K less than and greater than equal to N respectively
- Count the nodes in the given tree whose weight is a powerful number
- Find the minimum number to be added to N to make it a power of K
- Count of integers up to N which represent a Binary number
- Find most significant bit of a number X in base Y
- Find the Nth Hogben Numbers
- Represent K^N as the sum of exactly N numbers
- Count of pairs whose bitwise AND is a power of 2
- Count pairs in array such that one element is power of another
- Check if a large number is divisible by a number which is a power of 2
- Find number of pairs (x, y) in an Array such that x^y > y^x | Set 2
- Find elements in a given range having at least one odd divisor

Given a large number in the form of a string str and a number K, the task is to check if the number formed by… Read More »

Given an integer N, the task is to calculate the sum of first N natural numbers adding all powers of 2 twice to the sum.… Read More »

Given a number N, the task is to find the smallest number whose square has N digits. Examples: Input: N = 2 Output: 4 Explanation:… Read More »

Given an array arr[] of length N, the task is to print the number of array elements which cannot form a pair with any other… Read More »

Given an array arr[] of N positive integers. The task is to find the number of pairs whose Bitwise AND value is a power of… Read More »

Given two arrays X[] and Y[] of positive integers, find the number of pairs such that x^y > y^x where x is an element from… Read More »

Given two integers N and M, the task is to print all elements in the range [N, M] having at least one odd divisor. Examples:… Read More »

James Joyce’s “Ulysses” sequence represents the number of digits in NNN. First few terms in James Joyce’s “Ulysses” sequence are 1, 2, 13, 155, 2185,… Read More »

Given a positive number N, the task is to find out all the perfect powers of two which are less than or equal to the… Read More »

Given an array arr[] of N integers and a number K, the task is to find the sum of absolute difference of all pairs raised… Read More »

Given an integer N, the task is to find the numbers which when added after being raised to the Power of 2 gives the integer… Read More »

Given a positive N, the task is to find the last two digits of 7N. Examples: Input: N = 5 Output: 07 Explanation: The value… Read More »

Given two number X and N, the task is to find the last digit of X raised to last digit of N factorial, i.e. .… Read More »

Given two numbers X and Y, the task is to find the probability that an arbitrary positive divisor of 10X is an integral multiple of… Read More »

Given two positive integers L and R, the task is to count the elements from the range [L, R] whose prime factors are only 2… Read More »