## Common prime factors of two numbers

Given two integer and , the task is to find the common prime divisors of these numbers. Examples: Input: A = 6, B = 12… Read More »

## Check whether the sum of prime elements of the array is prime or not

Given an array having N elements. The task is to check if the sum of prime elements of the array is prime or not. Examples:… Read More »

## Check if a prime number can be expressed as sum of two Prime Numbers

Given a prime number . The task is to check if it is possible to express as sum of two separate prime numbers. Note: The… Read More »

## Smallest prime number missing in an array

Given an array containing n distinct numbers. The task is to find the smallest prime which is not present in the array. Note: If there… Read More »

## Find a number that divides maximum array elements

Given an array A[] of N non-negative integers. Find an Integer greater than 1, such that maximum array elements are divisible by it. In case… Read More »

## Sum and product of k smallest and k largest prime numbers in the array

Given an integer k and an array of integers arr, the task is to find the sum and product of k smallest and k largest… Read More »

## Sum of every K’th prime number in an array

Given an integer k and an array of integers arr (less than 10^6), the task is to find the sum of every k’th prime number… Read More »

## Find the super power of a given Number

Given an integer . The task is to find the superpower from the factorization of . The Superpower is the highest power among the power… Read More »

## Sum and Product of all Composite numbers which are divisible by k in an array

Given an array arr[] of N positive integers. The task is to find the sum of all composite elements which are divisible by a given… Read More »

## Count of Prime Nodes of a Singly Linked List

Given a singly linked list containing N nodes, the task is to find the total count of prime numbers. Examples: Input: List = 15 ->… Read More »

## Product of all the Composite Numbers in an array

Given an array of integers. The task is to calculate the product of all the composite numbers in an array. Note: 1 is neither prime… Read More »

## Count and Sum of composite elements in an array

Given an array ‘arr’ of positive integers, the task is to count the number of composite numbers in the array. Note: 1 is neither Prime… Read More »

## XOR of all Prime numbers in an Array

Given an array of integers arr[]. The task is to find the bitwise XOR of all the prime numbers present in the array. Examples: Input:… Read More »

## Product of every K’th prime number in an array

Given an integer ‘k’ and an array of integers ‘arr’ (less than 10^6), the task is to find the product of every K’th prime number… Read More »

## Find the Product of first N Prime Numbers

Given an positive integer N, calculate the product of the first N prime numbers. Examples: Input : N = 3 Output : 30 Explanation :… Read More »