## Program for Fibonacci numbers in PL/SQL

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 »

- Print all prime numbers less than or equal to N
- C Program to Check Whether a Number is Prime or not
- Python program to check whether a number is Prime or not
- Sum of the first N Prime numbers
- Sort only non-prime numbers of an array in increasing order
- Sum of all the prime numbers in a given range
- Length of largest sub-array having primes strictly greater than non-primes
- Largest palindromic prime in an array
- Minimum and Maximum prime numbers in an array
- Sum of all Primes in a given range using Sieve of Eratosthenes
- Python program to print all Prime numbers in an Interval
- Count number of primes in an array
- Delete all Prime Nodes from a Singly Linked List
- Find next palindrome prime
- Delete all Prime Nodes from a Circular Singly Linked List
- Numbers less than N which are product of exactly two distinct prime numbers
- Check if a prime number can be expressed as sum of two Prime Numbers
- Program to find Prime Numbers Between given Interval
- Check if the sum of primes is divisible by any prime from the array
- Count number of integers less than or equal to N which has exactly 9 divisors
- Find Largest Special Prime which is less than or equal to a given number
- Smallest prime number missing in an array
- Find two distinct prime numbers with given product
- Minimum absolute difference of a number and its closest prime
- Count subarrays with Prime sum
- Maximum GCD of N integers with given product
- Product of all primes in the range from L to R
- Check if difference of areas of two squares is prime
- Check n^2 - m^2 is prime or not
- Sum of all prime numbers in an Array

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 »

Vantieghems Theorem is a necessary and sufficient condition for a number to be prime. It states that for a natural number n to be prime,… Read More »

Given a number N, task is to Check whether it is a permutable prime number or not. A Permutable prime number is that number which… Read More »

Blum Integer is the number which only haves 2 factors suppose p and q (i.e. n = p * q), both are Semi-prime and also… Read More »

Hardy Ramanujam theorem states that the number of prime factors of n will approximately be log(log(n)) for most natural numbers n Examples : 5192 has… Read More »

Given a String str , the task is to check if the sum of ASCII value of all characters is a Prime Number or not.… Read More »

A k-rough or k-jagged number is a number whose smallest prime factor is greater than or equal to the number ‘k’. Given numbers ‘n’ and… Read More »

Given a number ‘n’, check whether it is an emirpimes or not. An emirpimes(“semiprime” when spelled backwards) derives its definition from the way it is… Read More »

Given an array of N integers, the task is to perform the following two queries: query(start, end) : Print the number of prime numbers in… Read More »

Given an array of non-negative integers and range query l, r, find number of prefix sum which are prime numbers in that given range. Prerequisite… Read More »

Given a number n, find the ordered prime signatures and using this find the number of divisor of given n. Any positive integer, ‘n’ can… Read More »

Given an integer n. we need to print all twin prime number pairs between 1 to n. A Twin prime are those numbers which are… Read More »