## Sum of numbers in a range [L, R] whose count of divisors is prime

Given Q queries where each query consists of an integer range [L, R], the task is to find the sum of the integers from the… Read More »

- New Algorithm to Generate Prime Numbers from 1 to Nth Number
- 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
- Maximize the size of array by deleting exactly k sub-arrays to make array prime
- Find the sum of the ascii values of characters which are present at prime positions
- Rearrange the array to maximize the number of primes in prefix sum of the array
- 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
- Print all numbers whose set of prime factors is a subset of the set of the prime factors of X
- Largest number not greater than N which can become prime after rearranging its digits
- Number of 0s and 1s at prime positions in the given array
- Count the number of primes in the prefix sum array of the given array
- Product of Primes of all Subsets
- Find prime numbers in the first half and second half of an array
- Find prime number K in an array such that (A[i] % K) is maximum
- 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
- Triangle of numbers arising from Gilbreath's conjecture
- Queries for the difference between the count of composite and prime numbers in a given range
- Count the nodes in the given tree whose weight is prime
- Program to find the next prime number
- Find the prime P using given four integers
- Check if the first and last digit of number N is prime and their sum is less than K

Given Q queries where each query consists of an integer range [L, R], the task is to find the sum of the integers from the… Read More »

Given K arrays where the first array contains the first prime number, the second array contains the next 2 primes and the third array contains… Read More »

Given two integers A and B. The task is to find the count of maximum elements from the common divisors of A and B such… Read More »

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

Given an array arr[] of N non-zero positive integers and an integer K, the task is to find the XOR of the K largest prime… Read More »

Given two numbers A and B. The task is to find the smallest positive integer greater than or equal to 1 such that the sum… Read More »

Given an array arr[] of N positive integers, the task is to calculate the absolute difference between XOR of non-prime numbers and prime numbers. Note… Read More »

Given an array arr[] of N integers. Value of a subset of array A is defined as the product of all prime numbers in that… Read More »

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 »