Prime number

import java.util.Scanner;
public class Prime 
{
    int prime(int y,int i)
    {
         if(i < y)
        {
            if(y % i != 0) 
            {
                return(prime(y, ++i));
            } 
            else
            {
                return 0; 
            }
        }
        return 1;
    }
	public static void main(String[] args) 
    {
        int n, x;
        Scanner s = new Scanner(System.in);
        System.out.print("Enter any number:");
        n = s.nextInt();
        Prime obj = new Prime();
        x = obj.prime(n, 2);
        if(x == 1)
         {
            System.out.println(n+" is prime number");
         }
        else
         {
            System.out.println(n+" is not prime number");
         }
    }
}
This entry was posted in recursion. Bookmark the permalink.

Leave a Reply

Your email address will not be published. Required fields are marked *