Write a Java program to check if the number entered by the user is Prime number or not.

Posted by on
# Write a Java program to check if the number entered by the user is Prime number or not.

Image is Unavailable


Algorithm

  1. Start
  2. x:=0
  3. If x<=1, go to step 4 or else go to step 8
  4. Print "Enter a number"
  5. Read x
  6. If x<=1, go to step 7 or else go to step 8
  7. Print "Invalid Input. Try Again". 
  8. count:=0
  9. i:=2
  10. If i<x, go to step 11 or else go to step 14
  11. If x%i==0, go to step 12 or else go to step 13
  12. count ++
  13. i++. Go to step 10.
  14. If count>0, go to step 15 or else go to step 16
  15. Print "The given number is not a prime number". Go to step 17
  16. Print "The given number is a prime number" 
  17. Stop

Program

Buffered Reader

import java.io.*;
class Prime
{
    int x;
    void accept() throws IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        while(x<=1)
        {
        System.out.println("Enter a number");
        x=Integer.parseInt(br.readLine());
        if(x<=1)
        {
            System.out.println("Invalid Input. Try Again.");
        }
    }
    }
    boolean checkPrime()
    {
        int count = 0;
        for(int i=2;i<x;i++)
        {
            if(x%i==0)
            {
                count++;
            }
        }
        if (count > 0)
        {
            return false;
        }
        else
        {
            return true;
        }
    }
    void displayt()
    {
        System.out.println("The given number is a prime number");
    }
    void displayf()
    {
        System.out.println("The given number is not a prime number");
    }
    void main() throws IOException
    {
        accept();
        if(checkPrime()==true)
        {
            displayt();
        }
        else
        {
            displayf();
        }
    }
}

Scanner

import java.util.*;
class Prime
{
    int x;
    void accept() 
    {
        Scanner sc=new Scanner(System.in);
        while(x<=1)
        {
        System.out.println("Enter a number");
        x=sc.nextInt();
        if(x<=1)
        {
            System.out.println("Invalid Input. Try Again.");
        }
    }
    }
    boolean checkPrime()
    {
        int count = 0;
        for(int i=2;i<x;i++)
        {
            if(x%i==0)
            {
                count++;
            }
        }
        if (count > 0)
        {
            return false;
        }
        else
        {
            return true;
        }
    }
    void displayt()
    {
        System.out.println("The given number is a prime number");
    }
    void displayf()
    {
        System.out.println("The given number is not a prime number");
    }
    void main() 
    {
        accept();
        if(checkPrime()==true)
        {
            displayt();
        }
        else
        {
            displayf();
        }
    }
}

Documentation

Variable Description

 Data Type Variable NameDescription 
 int
x  Accept a value from the user/
 int i Acts as a counter variable
 int count Counts the number of factors of a number except 1 and itself.

Method Description

 Return TypeFunction NameDescription 
 voidaccept() Accepts a value from the user 
boolean checkPrime() Checks if the given number is prime or not. 
 voiddisplayt() Displays the message if the condition is true 
void displayf() Displays the message if the condition is false 
void main() Acts as an execution gateway to the program 

Output:

Image Unavailable
Image Unavailable
Image Unavailable

Share with all ISC Computer Science Students you know.

Comment below with all your program requests and blog suggestions.

Follow us on social media by clicking on these links. 
Instagram : @IscJavaCode
Twitter: @IscCode
Quora: ISC Java Code
Pinterest: @ISCJavaCode
Facebook: @ISCJavaCode


Stay Healthy
Stay Happy
Stay Helpful


Comments

Post a Comment

You might also like:

Conversion of Complex Sentences to Simple Sentences

In this blog, we shall look at the various methods applied for the conversion of a Complex Sentences to Simple Sentences . The following examples have been taken from the english language textbook prescribed for ISC students studying in class 11. Use these as practice and climb your stepping stones to better grammar! A complex sentences can be converted to a simple sentence by changing a noun clause, an adjective clause or an adverb clause, as shown below: Noun Clause Complex:Tell me where you live. Simple:Tell me your address. Complex:That you should be present is essential. Simple:Your presence is essential. Adjective Clause Complex:Time which is once lost is lost forever. Simple:Time once lost is lost forever. Complex:I have no advice that I can offer you. Simple: I have no advice to offer you. Adverb Clause Complex:When he had finished his work, he went out to play. Simple:Having finished his work, he went out to play. Complex:If I make a promise, I will ke...
Image

Emirp Number | Write a program in Java to print an Emirp Number. | ISC Computer Science | ICSE Computer Applications

A prime number is a number that has only two factors, 1 and itself.  An Emirp number is a number, that when reversed, gives a prime number.  Example: 13, when reversed gives 31, which is a prime number. Note: Emirp numbers are not palindromes. Palindromes are numbers, which when reversed , give the same number.  Example: 131 when reversed, given 131.  Hence, 131 is a palindrome. 131 is not an emirp. Algorithm   Start n:=0 temp:=0 rev=0 digit:=0 i:=0 k:=0 Print "Enter a number" Read n temp=n If temp>0, go to step 12 or else go to step 16 digit=temp%10 rev=rev*10+digit temp=temp/10 Go to step 11 If step 17==true && n!=rev, then go to step 26 or else go to step 27 k=0. Go to step 18 i=2. Go to step 19 If i<n, go to step 20 or else go to step 23 If rev%i==0, go to step 21 or else go to step 22 k++. Go to step 22 i++. Go to step 19 If k==0, go to step 24 or else go to step 25 true. Go to step 17 false. Go to step 17 Print "The given number is an Emirp N...

Conversion of Complex Sentences to Compound Sentences

In this blogpost, we shall see the rules and guidelines that determine the conversion of Complex Sentences to Compound Sentences. The given examples have been taken from part B of Unit 2 in the English Language textbook prescribed for ISC class 11. We can change a Complex Sentence to a Compound Sentence by changing a Subordinate Clause into a Coordinate Clause. Coordinate Clause-  one of two or more clauses in a sentence that are of equal importance and usually joined by  and, or , or  but. Subordinate clause -  a clause, typically introduced by a conjunction, that forms part of and is dependent on a main clause. Complex: I have now found the pen that I had lost. Compound:I had lost the pen, but I have found it now. Complex: As soon as he saw the monkey, he ran away. Compound:He saw the monkey, and at once he ran away. Assignment Complex: If you do not run, you will not be in time. Compound: Run, or you will not be in time. Complex:...