## Prime Number of Set Bits in Binary Representation | Set 1

Given two integers ‘L’ and ‘R’, write a program to find the total numbers that are having prime number of set bits in their binary… Read More »

- Sum of the first N Prime numbers
- Largest factor of a given number which is a perfect square
- Sum of all the prime numbers in a given range
- Check if is possible to get given sum from a given set of elements
- Find a number that divides maximum array elements
- Largest palindromic prime in an array
- Minimum and Maximum prime numbers in an array
- Sum of all Primes in a given range using Sieve of Eratosthenes
- Count number of primes in an array
- Check if a prime number can be expressed as sum of two Prime Numbers
- Check if the sum of primes is divisible by any prime from the array
- Sum of element whose prime factors are present in array
- Count number of integers less than or equal to N which has exactly 9 divisors
- Find two distinct prime numbers with given product
- Smallest prime number missing in an array
- Lexicographically largest prime path from top-left to bottom-right in a matrix
- Product of all primes in the range from L to R
- Check if a number is a Trojan Number
- Sum of all prime numbers in an Array
- Longest Prime Subarray after removing one element
- Number of divisors of product of N numbers
- Print all safe primes below N
- Sum of elements in an array having prime frequency
- Find the Product of first N Prime Numbers
- Sort prime numbers of an array in descending order
- Check if a number is Primorial Prime or not
- Sum of every K’th prime number in an array
- Count all the numbers less than 10^6 whose minimum prime factor is N
- Maximum no. of contiguous Prime Numbers in an array
- Sum and product of k smallest and k largest prime numbers in the array

Given two integers ‘L’ and ‘R’, write a program to find the total numbers that are having prime number of set bits in their binary… Read More »

Given Q queries. Each query contain a positive integer n. The task is to output the sum of sum of odd number digit contained in… Read More »

Given a number N, print all prime number smaller than or equal to N in reverse order . For example, if N is 9, the… Read More »

In number theory, an arithmetic number is an integer for which the average of its positive divisors is also an integer. Or in other words,… Read More »

A k-rough or k-jagged number is a number whose smallest prime factor is greater than or equal to the number ‘k’. Given numbers ‘n’ and… Read More »

Given a number n, find the ordered prime signatures and using this find the number of divisor of given n. Any positive integer, ‘n’ can… Read More »

Given an integer n. we need to print all twin prime number pairs between 1 to n. A Twin prime are those numbers which are… Read More »

A cube free number square free number whose none of any divisor is a cubic number (a number which is cube of an integer). Given… Read More »

A frugal number is a number whose number of digits is strictly greater than the number of digits in its prime factorization (including exponents). If… Read More »

Given two numbers N and M. Find the number of ways in which factorial N can be expressed as a sum of two or more… Read More »

Given a number n, we need to find the product of all prime numbers between 1 to n. Examples: Input: 5 Output: 30 Explanation: product… Read More »

Given three numbers sum S, prime P and N, find all N prime numbers after prime P such that their sum is equal to S.… Read More »

Write a program to print all sophie germain number less than n. A prime number p is called a sophie prime number if 2p+1 is… Read More »

Prime Triplet is a set of three prime numbers of the form (p, p+2, p+6) or (p, p+4, p+6). This is the closest possible grouping… Read More »

Given an array A[], find a subset of maximum size in which sum of every pair of elements is a prime number. Print its length… Read More »