FilesExpand file tree

 master

/

PrimeNumberChecker.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

47 lines (37 loc) · 1.2 KB

 master

/

PrimeNumberChecker.java

Copy path

Top

File metadata and controls

• Code
• Blame

47 lines (37 loc) · 1.2 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

import java.util.Scanner;

public class PrimeNumberChecker {

public static void main(String[] args) {

long number,i;

boolean flag = false;

System.out.println("A Program to check if the entered number is a Prime Number or not.\n---");

Scanner sm = new Scanner(System.in);

System.out.print("Enter the Natural Number: ");

number = sm.nextInt();

if (number==1) {

System.out.println("1 is not a Prime Number."

+ "\n---\nExplanation: "

+ "A natural number (i.e. 1, 2, 3, 4, 5, 6, etc.) is called a prime number\n(or a prime) if it has exactly two positive factors, 1 and the number itself.\n1 has only one positive factor i.e. no. 1 only. Hence 1 is neither prime nor composite.");

System.exit(0);

}

if (number<1) {

System.out.println("Error: Input is negative or zero.\nTry Again!\n---");

main(null);

}

for (i=2; i<number/2; i++) {

if(number%i==0) {

System.out.println(number+" is not a Prime Number. It is divisible by: "+i);

flag=true;

break;

}

if(flag) {

break;

}

}

if (flag==false) {

System.out.println(number+" is a Prime Number.");

}

sm.close();

System.out.println("---\nThe Program has ended.");

System.exit(0);

}

}