## Number of trailing zeroes in base B representation of N!

Given two positive integers B and N. The task is to find the number of trailing zeroes in b-ary (base B) representation of N! (factorial… Read More »

- Make all numbers of an array equal
- Check if a number can be expressed as a^b | Set 2
- Convert a String to Integer Array in C/C++
- Number of array elements derivable from D after performing certain operations
- Ways to write N as sum of two or more positive integers | Set-2
- Modulo power for large numbers represented as strings
- Find numbers a and b that satisfy the given conditions
- Program to Convert Hexadecimal Number to Binary
- Count numbers upto N which are both perfect square and perfect cube
- Check whether a number is Non-hypotenuse number
- Find minimum possible digit sum after adding a number d
- Sum of common divisors of two numbers A and B
- Most frequent factor in a range of integers
- Count Odd and Even numbers in a range from L to R
- Closest sum partition (into two subsets) of numbers from 1 to n
- Program to find first N Iccanobif Numbers
- Program to solve the Alligation Problem
- Minimum number of elements to be removed to make XOR maximum
- Check if difference of areas of two squares is prime
- Check if a number has digits in the given Order
- Count Numbers with N digits which consists of even number of 0’s
- Sum of first N natural numbers which are divisible by X or Y
- Check if a number is Primorial Prime or not
- Minimum multiplications with {2, 3, 7} to make two numbers equal
- Value of the series (1^3 + 2^3 + 3^3 + ... + n^3) mod 4 for a given n
- Natural Numbers
- Divide a number into two parts such that sum of digits is maximum
- ElGamal Encryption Algorithm
- Maximum of sum and product of digits until number is reduced to a single digit
- Program to find count of numbers having odd number of divisors in given range

Given two positive integers B and N. The task is to find the number of trailing zeroes in b-ary (base B) representation of N! (factorial… Read More »

Given an array of n length. The task is to check if the given array can be split into an odd number of sub-segment starting… Read More »

Given a number N. The task is to count the number of prime numbers from 2 to N that can be expressed as a sum… Read More »

Given two integers N and K, the task is to find a permutation of first 2*N natural numbers such that the following equation is satisfied.… Read More »

Given a number n, the task is to print all the numbers less than or equal to n which are perfect cubes as well as… Read More »

Given two numbers A and B ( A and B can be up to 106 ) which forms a number N = (A!/B!). The task… Read More »

Given three positive integers N, A and B. The task is to count the numbers of length N containing only digits A and B and… Read More »

Given an array arr[], the task is to make all the array elements equal with the given operation. In a single operation, any element of… Read More »

Given two numbers L and R, the task is to count the number of odd numbers in the range L to R. Examples: Input: l… Read More »

Given an integer sequence 1, 2, 3, 4, …, n. The task is to divide it into two sets A and B in such a… Read More »

Given a Natural number N and a whole number L, the task is to find the count of numbers, smaller than or equal to N,… Read More »

Given two numbers A and B, the task is to find the minimum number of operations required to make A and B equal. In each… Read More »

Given a positive integer n, the task is to check if n is a Non-hypotenuse number or not. If n is a Non-hypotenuse number then… Read More »

Given a positive integer N, the task is to check if N is a strong prime or not. In number theory, a strong prime is… Read More »

Given a positive integer . Find the number of steps required to minimize it to 1. In a single step N either got reduced to… Read More »