## Program to find the Nth Prime Number

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

## Product of Primes of all Subsets

Given an array a[] of size N. The value of a subset is the product of primes in that subset. A non-prime is considered to… Read More »

## Sum of prime numbers without odd prime digits

Given an integer N. The task is to find the sum of the first N prime numbers which don’t contain any odd primes as their… Read More »

## Check if the given string is vowel prime

Given a string str of lowercase English alphabets, the task is to check whether the string is a vowel prime or not. A string is… Read More »

## Sum of Semi-Prime Numbers less than or equal to N

Given an integer N, the task is to find the sum of semi-prime numbers which are less than or equal to N. A Semi prime… Read More »

## Rearrange the given string such that all prime multiple indexes have same character

Given a string str of size N. The task is to find out whether it is possible to rearrange characters in string str so that… Read More »

## Generate elements of the array following given conditions

Given an integer N, for every integer i in the range 2 to N, assign a positive integer such that the following conditions hold :… Read More »

## Queries for the difference between the count of composite and prime numbers in a given range

Given Q queries where each query consists of two positive integers L and R and the task is to find the absolute difference between the… Read More »

## Check if each element of the given array is the product of exactly K prime numbers

Given an array of numbers and the value of , check if each number can be expressed as the product of exactly prime numbers. For… Read More »

## Maximize the size of array by deleting exactly k sub-arrays to make array prime

Given an array arr[] of N positive integers and a non negative integer K. The task is to delete exactly K sub-arrays from the array… Read More »

## Count the number of primes in the prefix sum array of the given array

Given an array arr[] of N integers, the task is to count the number of primes in the prefix sum array of the given array.… Read More »

## Find prime number K in an array such that (A[i] % K) is maximum

Given an array arr[] of n integers. The task is to find an element from the array K such that K is prime. And, arr[i]… Read More »

## Largest number not greater than N which can become prime after rearranging its digits

Given a number N, the task is to find the largest number less than or equal to the given number N such that on rearranging… Read More »

## Check whether N is a Dihedral Prime Number or not

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 »

## Sum of multiplication of triplet of divisors of a number

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 »