-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprimeNo.java
More file actions
60 lines (58 loc) · 1.23 KB
/
Copy pathprimeNo.java
File metadata and controls
60 lines (58 loc) · 1.23 KB
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
48
49
50
51
52
53
54
55
56
57
58
59
60
import java.util.Scanner;
public class primeNo {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
boolean b;
do {
System.out.println("1. Prime Number Check \n2. Range for Prime Number");
int num = sc.nextInt();
switch(num)
{
case 1:
System.out.print("Enter any Number to Check ");
int n = sc.nextInt();
primeCheck(n);
break;
case 2:
System.out.println("Enter The Range To Find all Prime Number ");
int n1 = sc.nextInt();
primeRange(n1);
break;
default:
System.out.println("You Have entered Wrong Key ");
break;
}
System.out.println("\nDo You Want To Close (Y/N) ");
char ch = sc.next().charAt(0);
if(ch =='Y' || ch == 'y')
b = false;
else
b = true;
}while(b);
}
public static void primeCheck(int n)
{
int c = 0;
for(int i = 2; i<n; i++) {
if(n % i == 0)
c++;
}
if(c == 0)
System.out.print("Prime Number " + n);
else
System.out.print("Not Prime Number " + n);
}
public static void primeRange(int r)
{
for(int k = 2; k<=r; k++)
{
int c = 0;
for(int i = 2; i<k; i++) {
if(k % i == 0)
c++;
}
if(c == 0)
System.out.print(k + " ");
}
}
}