## Sum of the series 1.2.3 + 2.3.4 + … + n(n+1)(n+2)

Find the sum up to n terms of the series: 1.2.3 + 2.3.4 + … + n(n+1)(n+2). In this 1.2.3 represent the first term and… Read More »

- Make all numbers of an array equal
- Number of array elements derivable from D after performing certain operations
- Program to Convert Hexadecimal Number to Binary
- ElGamal Encryption Algorithm
- Find numbers a and b that satisfy the given conditions
- Count numbers upto N which are both perfect square and perfect cube
- Sum of common divisors of two numbers A and B
- Count Odd and Even numbers in a range from L to R
- Program to find first N Iccanobif Numbers
- Check whether a number is Non-hypotenuse number
- Closest sum partition (into two subsets) of numbers from 1 to n
- Most frequent factor in a range of integers
- Prime Factor
- Minimum multiplications with {2, 3, 7} to make two numbers equal
- Check if a number is Primorial Prime or not
- Check if difference of areas of two squares is prime
- Natural Numbers
- Program to find count of numbers having odd number of divisors in given range
- Count Numbers with N digits which consists of even number of 0’s
- Check if N is Strong Prime
- Find two numbers whose sum and GCD are given
- Smallest number greater than or equal to N divisible by K
- Sum of first N natural numbers which are divisible by X or Y
- Count of Numbers such that difference between the number and sum of its digits not less than L
- Find the k-th smallest divisor of a natural number N
- Value of the series (1^3 + 2^3 + 3^3 + ... + n^3) mod 4 for a given n
- Program to check whether a number is Proth number or not
- Find maximum operations to reduce N to 1
- Steps to reduce N to zero by subtracting its most significant digit at every step
- Greatest Integer Function

Find the sum up to n terms of the series: 1.2.3 + 2.3.4 + … + n(n+1)(n+2). In this 1.2.3 represent the first term and… Read More »

Prerequisite: Hamiltonian Cycle Given an integer n(>=2), find a permutation of numbers from 1 to n such that the sum of two consecutive numbers of… Read More »

In this article we will discuss about Lucas-Lehmer series which is used to check primality of prime numbers of the form 2p – 1 where… Read More »

Given N, check if the number is Fibbinary Number or not. Fibbinary numbers are integers whose binary representation contains no consecutive ones. Examples : Input… Read More »

A P-smooth number or P-friable number is an integer whose largest prime factor is less than or equal to P. Given N and P, we… Read More »

Given a range [L, R], and a prime number P. We are required to find the sum of the highest power of P in all… Read More »

Give a positive integer n, find modular multiplicative inverse of all integer from 1 to n with respect to a big prime number, say, ‘prime’.… Read More »

Given two integers N and D, Find a set of N integers such that difference between their product and sum is equal to D. Examples… Read More »

Given a positive integer n. The problem is to print numbers in the range 1 to n having first and last bits as the only… Read More »

Given two numbers, fact and n, find the largest power of n that divides fact! (Factorial of fact). Examples: Input : fact = 5, n… Read More »

Write a program to print first n non-square number (non perfect square) . Examples : Input : 5 Output : 2 3 5 6 7… Read More »

Given a number n, we need to count square numbers smaller than or equal to n. Examples : Input : n = 5 Output :… Read More »

Given two integer N or M find the number of zero’s trailing in product of factorials (N!*M!)? Examples: Input : N = 4, M =… Read More »

Given an odd number n, find the average of odd numbers from 1 to n. Examples: Input : n = 9 Output : 5 Explanation… Read More »

Write a program to find the sum of Fifth powers of the first n natural numbers 15 + 25+ 35 + 45+ …….+ n5 till… Read More »