Recursive program for prime number Last Updated : 27 Jan, 2022 Summarize Comments Improve Suggest changes Share Like Article Like Report Given a number n, check whether it's prime number or not using recursion.Examples: Input : n = 11 Output : Yes Input : n = 15 Output : No The idea is based on school method to check for prime numbers. C++ // CPP Program to find whether a Number // is Prime or Not using Recursion #include <bits/stdc++.h> using namespace std; // Returns true if n is prime, else // return false. // i is current divisor to check. bool isPrime(int n, int i = 2) { // Base cases if (n <= 2) return (n == 2) ? true : false; if (n % i == 0) return false; if (i * i > n) return true; // Check for next divisor return isPrime(n, i + 1); } // Driver Program int main() { int n = 15; if (isPrime(n)) cout << "Yes"; else cout << "No"; return 0; } Java // java Program to find whether a Number // is Prime or Not using Recursion import java.util.*; class GFG { // Returns true if n is prime, else // return false. // i is current divisor to check. static boolean isPrime(int n, int i) { // Base cases if (n <= 2) return (n == 2) ? true : false; if (n % i == 0) return false; if (i * i > n) return true; // Check for next divisor return isPrime(n, i + 1); } // Driver program to test above function public static void main(String[] args) { int n = 15; if (isPrime(n, 2)) System.out.println("Yes"); else System.out.println("No"); } } // This code is contributed by Sam007. Python3 # Python 3 Program to find whether # a Number is Prime or Not using # Recursion # Returns true if n is prime, else # return false. # i is current divisor to check. def isPrime(n, i = 2): # Base cases if (n <= 2): return True if(n == 2) else False if (n % i == 0): return False if (i * i > n): return True # Check for next divisor return isPrime(n, i + 1) # Driver Program n = 15 if (isPrime(n)): print("Yes") else: print("No") # This code is contributed by # Smitha Dinesh Semwal C# // C# Program to find whether a Number // is Prime or Not using Recursion using System; class GFG { // Returns true if n is prime, else // return false. // i is current divisor to check. static bool isPrime(int n, int i) { // Base cases if (n <= 2) return (n == 2) ? true : false; if (n % i == 0) return false; if (i * i > n) return true; // Check for next divisor return isPrime(n, i + 1); } // Driver code static void Main() { int n = 15; if (isPrime(n, 2)) Console.Write("Yes"); else Console.Write("No"); } } // This code is contributed by Sam007 PHP <?php // PHP Program to find whether a Number // is Prime or Not using Recursion // Returns true if n is prime, else // return false. // i is current divisor to check. function isPrime($n, $i = 2) { // Base cases if ($n <= 2) return ($n == 2) ? true : false; if ($n % $i == 0) return false; if ($i * $i > $n) return true; // Check for next divisor return isPrime($n, $i + 1); } // Driver Code $n = 15; if (isPrime($n)) echo("Yes"); else echo("No"); // This code is contributed by Ajit. ?> JavaScript <script> // JavaScript program to find whether a Number // is Prime or Not using Recursion // Returns true if n is prime, else // return false. // i is current divisor to check. function isPrime(n, i) { // Base cases if (n <= 2) return (n == 2) ? true : false; if (n % i == 0) return false; if (i * i > n) return true; // Check for next divisor return isPrime(n, i + 1); } // Driver code let n = 15; if (isPrime(n, 2)) document.write("Yes"); else document.write("No"); </script> Output: No Comment More infoAdvertise with us Next Article Python Program to Check Prime Number S Shahnawaz_Ali Follow Improve Article Tags : Misc Mathematical Recursion DSA Prime Number +1 More Practice Tags : MathematicalMiscPrime NumberRecursion Similar Reads Program to find the Nth Prime Number Given an integer N. The task is to find the Nth prime number. Examples: Input : 5 Output : 11 Input : 16 Output : 53 Input : 1049 Output : 8377 Approach: Find the prime numbers up to MAX_SIZE using Sieve of Eratosthenes.Store all primes in a vector.For a given number N, return the element at (N-1)th 12 min read Program to find the next prime number Given an integer N. The task is to find the next prime number i.e. the smallest prime number greater than N. Examples: Input: N = 10 Output: 11 11 is the smallest prime number greater than 10. Input: N = 0 Output: 2 Approach: First of all, take a boolean variable found and initialize it to false.Now 5 min read Python Program to Check Prime Number Given a positive integer, check if the number is prime or not. A prime is a natural number greater than 1 that has no positive divisors other than 1 and itself. Examples of first few prime numbers are {2, 3, 5, Examples: Input: n = 11 Output: true Input: n = 15 Output: false Input: n = 1 Output: fal 2 min read Program to print prime numbers from 1 to N. Given a number N, the task is to print the prime numbers from 1 to N.Examples: Input: N = 10Output: 2, 3, 5, 7Explanation : The output "2, 3, 5, 7" for input N = 10 represents the list of the prime numbers less than or equal to 10. Input: N = 5Output: 2, 3, 5 Explanation : The output "2, 3, 5" for i 15+ min read Program to find Prime Fibonacci Numbers till N Given a number, find the numbers (smaller than or equal to n) which are both Fibonacci and prime.Examples: Input : n = 40 Output: 2 3 5 13 Explanation : Here, range(upper limit) = 40 Fibonacci series upto n is, 1, 1, 2, 3, 5, 8, 13, 21, 34. Prime numbers in above series = 2, 3, 5, 13. Input : n = 10 8 min read Prime numbers after prime P with sum S Given three numbers sum S, prime P, and N, find all N prime numbers after prime P such that their sum is equal to S.Examples : Input : N = 2, P = 7, S = 28 Output : 11 17 Explanation : 11 and 17 are primes after prime 7 and (11 + 17 = 28) Input : N = 3, P = 2, S = 23 Output : 3 7 13 5 7 11 Explanati 13 min read Like