## Check if the first and last digit of the smallest number forms a prime

Given an array arr[] containing numbers from 0 to 9 only, the task is to form the minimum possible number from the given digits and… Read More »

Given an array arr[] containing numbers from 0 to 9 only, the task is to form the minimum possible number from the given digits and… Read More »

Given a positive integer . The task is to write a C program to check if the number is prime or not. Definition: A prime… Read More »

Given a number N. The task is to write a program to find the N-th term in the below series: 0, 2, 1, 3, 1,… Read More »

Given an arr[] of positive integers you have to count how many numbers can be represented as sum of same parity prime numbers(can be same)… Read More »

We have to print alternate prime numbers till N. Examples: Input : N = 10 Output : 2 5 Input : N = 15 Output… Read More »

Given Q queries which consist of two integers, one is number(1 <= number <= 106) and the other is N., the task is to find… Read More »

Find the minimum number of single-digit prime numbers required whose sum will be equal to N. Examples: Input: 11 Output: 3 Explanation: 5 + 3… Read More »

Given a number N. The task is to print the nearest prime if the number is not prime by making it prime by adding prime… Read More »

Given an array arr[] of n elements and a number K. The task is to determine if it is possible to reach the end of… Read More »

Generate all prime numbers between two given numbers. The task is to print prime numbers in that range. The Sieve of Eratosthenes is one of… Read More »

Given a number ‘n’, generate the first ‘n’ terms of the Smarandache-Wellin Sequence. The Smarandache-Wellin Sequence is a sequence formed by the Smarandache-Wellin numbers. Each… Read More »

The Fibonacci numbers are the numbers in the following integer sequence. 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, ……..… Read More »

Given two integers ‘L’ and ‘R’, write a program to find the total numbers that are having prime number of set bits in their binary… Read More »

Prerequisite – PL/SQL introduction A prime number is a whole number greater than 1, which is only divisible by 1 and itself. First few prime… Read More »

Given a number N, print all prime number smaller than or equal to N in reverse order . For example, if N is 9, the… Read More »