## Bitwise AND of the sum of prime numbers and the sum of composite numbers in an array

Given an array of positive numbers, the task is to find the bitwise AND of the sum of non-prime numbers and the sum of prime… Read More »

- Program to find the Nth Prime Number
- Generate elements of the array following given conditions
- Longest subsequence such that every element in the subsequence is formed by multiplying previous element with a prime
- Count occurrences of a prime number in the prime factorization of every element from the given range
- Check if each element of the given array is the product of exactly K prime numbers
- Find the sum of the ascii values of characters which are present at prime positions
- Check if the given string is vowel prime
- Find a sequence of N prime numbers whose sum is a composite number
- Generate N integers satisfying the given conditions
- Find out the prime numbers in the form of A+nB or B+nA
- Number of 0s and 1s at prime positions in the given array
- Find prime numbers in the first half and second half of an array
- Product of Primes of all Subsets
- Sum of numbers in a range [L, R] whose count of divisors is prime
- Minimum operations required to convert X to Y by multiplying X with the given co-primes
- Ramanujan Prime
- Sum of Semi-Prime Numbers less than or equal to N
- XOR of elements in an array having prime frequency
- Program to find the next prime number
- Triangle of numbers arising from Gilbreath's conjecture
- Queries for the difference between the count of composite and prime numbers in a given range
- Find the sum of prime numbers in the Kth array
- Find the prime P using given four integers
- Find all numbers between range L to R such that sum of digit and sum of square of digit is prime
- Check if the first and last digit of number N is prime and their sum is less than K
- Find the XOR of first N Prime Numbers
- Bitwise AND of the sum of prime numbers and the sum of composite numbers in an array
- Sum of prime numbers without odd prime digits
- Absolute difference between the XOR of Non-Prime numbers and Prime numbers of an Array
- Partition first N natural number into two sets such that their sum is not coprime

Given an array of positive numbers, the task is to find the bitwise AND of the sum of non-prime numbers and the sum of prime… Read More »

Given an array arr[] of N elements, the task is to find the xor of the elements which have prime frequencies in the array. Note… Read More »

Given two integers A and B and an integer N. The task is to find out N prime numbers of the form A + nB… Read More »

Given a string str containing only lowercase characters. The task is to print the characters having prime frequency in the order of their occurrence. Note… Read More »

Given an array arr[] of N elements, the task is to find the product of the elements which have prime frequencies in the array. Since,… Read More »

Given a positive integer N, the task is to find the XOR of the first N prime numbers. Examples: Input: N = 3 Output: 4… Read More »

Given three integers L, R and P where P is prime, the task is to count the number of times P occurs in the prime… Read More »

Given two integers K and N, the task is to find the count of integers from the range [2, N – 1] whose sum of… Read More »

Given Q queries where every query consists of an integer D, the task is to find the smallest and the largest prime number with D… Read More »

Given a range L and R count all numbers between L to R such that sum of digit of each number and sum of square… Read More »

Given an integer N, the task is to generate an array of size N with the following properties: No two elements divide each other. Every… Read More »

Given an integer N. The task is to find the next prime number i.e. the smallest prime number greater than N. Examples: Input: N =… Read More »

Given two integers L and R (L < = R). The task is to find all square free semiprimes in the range L to R… Read More »

Given an integer N. The task is to find the Nth prime number. Examples: Input : 5 Output : 11 Input : 16 Output :… Read More »

Given a number N, the task is to check if its first and last digit is a prime number and their sum is less than… Read More »