-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdisplayFact.java
More file actions
67 lines (49 loc) · 1.57 KB
/
Copy pathdisplayFact.java
File metadata and controls
67 lines (49 loc) · 1.57 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
61
62
63
64
65
66
67
package Display_Factors;
import java.util.Scanner;
public class displayFact {
private int number;
private int factorCount;
private int[] factors;
public displayFact(int number) {
this.number = number;
factors = new int[number];
factorCount = 0;
}
//Find Prime Number
public void primeNumber() {
for(int i = 1; i <= number; i++){
if(number % i == 0){
factors[factorCount] = i;
factorCount++;
}
}
if(factorCount == 2){
System.out.println("Factor Count: " + factorCount);
System.out.println("Status: " + number + " is prime number");
}
else{
System.out.println("Factor Count: " + factorCount);
System.out.println("Status: " + number + " is not prime number");
}
}
//display factors
public void displayFact() {
System.out.print("Factors: ");
if(factorCount > 0){
System.out.print(factors[0]);
}
for(int i = 1; i < factorCount; i++){
System.out.print("," + factors[i]);
}
}
//Main method
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
System.out.print("Enter the number: ");
int number = input.nextInt();
displayFact prime = new displayFact(number);
System.out.println("\nnumber: " + number);
prime.primeNumber();
prime.displayFact();
}
}