Check prime number using Recursion

SOURAV KUMAR PATRA November 28, 2020

Problem statement:- Program to check the given number is Prime or not using Recursion.

Data requirement:-

   Input Data:- num

  Output Data:-String Output

Program in C

Here is the source code of the C Program to check prime numbers using Recursion.

Code:

#include<stdio.h>
#include<math.h>
int CheckPrime(int i,int num)
{
    if(num==i)
        return 0;
    else
        if(num%i==0)
            return 1;
    else{
        return CheckPrime(i+1,num);
    }
}
int main()
{
    int num;
    printf("Enter your Number:");
    scanf("%d",&num);

    if(CheckPrime(2,num)==0)
        printf("It is a Prime Number.");
    else
        printf("It is not a Prime Number.");
}

Input/Output:
Enter your Number:5
It is a Prime Number.

Program in C++

Here is the source code of the C++ Program to check the given number is Prime or not using recursion.

Code:

#include<iostream>
#include<cmath>
using namespace std;
int CheckPrime(int i,int num)
{
    if(num==i)
        return 0;
    else
        if(num%i==0)
            return 1;
    else{
        return CheckPrime(i+1,num);
    }
}
int main()
{
    int num;
    cout<<"Enter your Number:";
    cin>>num;

    if(CheckPrime(2,num)==0)
        cout<<"It is a Prime Number.";
    else
        cout<<"It is not a Prime Number.";
}

Input/Output:
Enter your Number:74
It is not a Prime Number.

Program in Java

Here is the source code of the Java Program to check prime numbers using Recursion.

Code:

import java.util.Scanner;
public class CheckPrimeNumber {
static int CheckPrime(int i,int num)
{
    if(num==i)
        return 0;
    else
        if(num%i==0)
            return 1;
    else{
        return CheckPrime(i+1,num);
    }
}
public static void main(String[] args) {
           Scanner cs=new Scanner(System.in);
    int num;
    System.out.print("Enter your Number:");
    num=cs.nextInt();
    if(CheckPrime(2,num)==0)
    System.out.print("It is a Prime Number.");
    else
    System.out.print("It is not a Prime Number.");
        cs.close();
}
}

Input/Output:
Enter your Number:17
It is a Prime Number.

Program in Python

Here is the source code of the Python Program to check the given number is Prime or not using recursion.

Code:

def CheckPrime(i,num):
    if num==i:
        return 0
    else:
        if(num%i==0):
            return 1
        else:
            return CheckPrime(i+1,num)
num=int(input("Enter your Number:"))
if(CheckPrime(2,num)==0):
    print("It is a Prime Number.")
else:
    print("It is not a Prime Number.")

Input/Output:
Tags:

Post a Comment

2 Comments

  1. Anjana NanayakkaraAugust 3, 2021 at 3:37 PM

    what happen to 1

    ReplyDelete
  2. AnonymousMarch 24, 2022 at 12:54 AM

    Check this for C

    int isprime(int a, int b) //b=a;
    {
    if(a==2){return 1;}
    --a;
    if(b%a==0){return 0; }
    else{return isprime(a, b);}
    }

    ReplyDelete

Please do not Enter any spam link in the comment box