## New Algorithm to Generate Prime Numbers from 1 to Nth Number

Apart from Sieve of Eratosthenes method to generate Prime numbers, we can implement a new Algorithm for generating prime numbers from 1 to N. It… 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
- Count rotations of N which are Odd and Even
- ElGamal Encryption Algorithm
- Find numbers a and b that satisfy the given conditions
- Largest number N which can be reduced to 0 in K steps
- 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
- Prime Factor
- Program to find first N Iccanobif Numbers
- Check whether a number is Non-hypotenuse number
- Length of the longest increasing subsequence such that no two adjacent elements are coprime
- Smallest and Largest Palindrome with N Digits
- Closest sum partition (into two subsets) of numbers from 1 to n
- Most frequent factor in a range of integers
- Minimum multiplications with {2, 3, 7} to make two numbers equal
- Natural Numbers
- Check if a number is Primorial Prime or not
- Find two numbers whose sum and GCD are given
- Check if difference of areas of two squares is prime
- Program to find count of numbers having odd number of divisors in given range
- Smallest number greater than or equal to N divisible by K
- Number of trailing zeroes in base B representation of N!
- Count Numbers with N digits which consists of even number of 0’s
- Check if N is Strong Prime
- 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

Apart from Sieve of Eratosthenes method to generate Prime numbers, we can implement a new Algorithm for generating prime numbers from 1 to N. It… Read More »

There are two players P1 and P2 and two piles of coins consisting of M and N coins respectively. At each turn, a player can… Read More »

Given a number X and an array of N numbers. The task is to print all the numbers in the array whose set of prime… Read More »

Given a 3-digit number N, the task is to find if N is an Osiris number or not. Osiris numbers are the numbers that are… Read More »

Given an integer n, the task is to check if n is a Dudeney number or not. A Dudeney number is a positive integer that… Read More »

Given an integer N, the task is to check if N is a Dihedral prime number or not. A Dihedral prime is a prime number… Read More »

Given an integer N. The task is to find the number of integers 1 < x < N, for which x and x + 1… Read More »

Given three integer n, m and k. Find the element at kth position after repeating the given operation n number of times. In a single… Read More »

Given an array arr[] of size N. The task is to find the length of the longest subsequence from the given array such that the… Read More »

Given an array arr[] of integers of size n. For each element, you have to print the summation of multiplication of every triplet formed using… Read More »

Given an integer N, the task is to find whether fact(N) is divisible by sum(N) where fact(N) is the factorial of N and sum(N) =… Read More »

Given an integer N(1<=N<=10^9). The task is to represent N as a sum of the maximum possible number of composite summands and print this maximum… Read More »

Given a number. The task is to count the number of Trailing Zero in Binary representation of a number using bitset. Examples: Input : N… Read More »

Given an integer N. The following tasks are performed: The number is noted. The leading digit from N is subtracted from N and the resulting… Read More »

Given a number n, the task is to count all rotations of the given number which are odd and even. Examples: Input: n = 1234… Read More »