## 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 »

- Generate elements of the array following given conditions
- Program to find the Nth Prime Number
- 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
- Check if the given string is vowel prime
- Sum of all odd factors of numbers in the range [l, r]
- Largest number not greater than N which can become prime after rearranging its digits
- Count the number of primes in the prefix sum array of the given array
- Sum of all even factors of numbers in the range [l, r]
- Sum of Semi-Prime Numbers less than or equal to N
- Find prime number K in an array such that (A[i] % K) is maximum
- Sum of multiplication of triplet of divisors of a number
- Count of distinct sums that can be obtained by adding prime numbers from given arrays
- Check for an array element that is co-prime with all others
- Check whether N is a Dihedral Prime Number or not
- Product of Primes of all Subsets
- Queries for the difference between the count of composite and prime numbers in a given range
- Find the sum of all Truncatable primes below N
- Rearrange the given string such that all prime multiple indexes have same character
- Sum of prime numbers without odd prime digits
- Square free semiprimes in a given range using C++ STL

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 »

Given two arrays arr1[] and arr2[]. The task is to count the distinct sums that can be obtained while choosing a prime element from arr1[]… Read More »

Given an integer N, the task is to find the sum of all Truncatable primes below N. Truncatable prime is a number which is left-truncatable… Read More »

Given a range [l, r], the task is to find the sum of all the even factors of the numbers from the given range. Examples:… Read More »

Given a range [l, r], the task is to find the sum of all the odd factors of the numbers from the given range. Examples:… Read More »

Given an array arr[] of positive integers where 2 ≤ arr[i] ≤ 106 for all possible values of i. The task is to check whether… Read More »

Given a number N. The task is to find the smallest special prime which is greater than or equal to N. A special prime is… Read More »

Given a number N. The task is to count the number of prime numbers from 2 to N that can be expressed as a sum… Read More »

Given a range [L, R], the task is to find all the numbers from the range which are composite as well as the eventual sum… Read More »

Given two numbers A and B ( A and B can be up to 106 ) which forms a number N = (A!/B!). The task… Read More »

Given an integer N, the task is to print all the multiplicative primes ≤ N. Multiplicative Primes are the primes such that the product of… Read More »

Given an array arr[] and the task is to print the additive primes in an array. Additive primes: Primes such that the sum of their… Read More »

Given an array arr[] of distinct elements, the task is to count the total number of distinct pairs in which at least one element is… Read More »

Given an integer N, the task is to print all safe primes below N safe primes. A safe prime is a prime number of the… Read More »

Given an array arr[] and the task is to print the sum of the non-prime elements from the array. Examples: Input: arr[] = {1, 3,… Read More »