Smarandache-Wellin Sequence
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 »
Tag Archives: Prime Number
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 »
Prime Number of Set Bits in Binary Representation | Set 1
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 »
Prime number in PL/SQL
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 »
Print prime numbers from 1 to N in reverse order
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 for Primality Test
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 »
Check a number for Permutable Prime
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
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-Ramanujan Theorem
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 »
Prime String
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 »
k-Rough Number or k-Jagged Number
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 »
Check whether a number is Emirpimes or not
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 »
Number of primes in a subarray (with updates)
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 »
Number of prefix sum prime in given range query
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 »
Ordered Prime Signature
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 »