Write a program that consists of a “isPrime” method that takes an integer as a p
ID: 3869818 • Letter: W
Question
Write a program that consists of a “isPrime” method that takes an integer as a parameter and returns a Boolean value that indicates whether the parameter is a prime number(i.e. returns true if it is a prime number, false if it is not prime). The method signature should like this:
public static boolean isPrime(int num)
In your “main” method, prompt the user to input a list of numbers. Assume that the input ends with number 0. The main method will make a call to “isPrime” for each number to determine whether that number is a prime number. The “main” method will display the results to the user.
Here's a sample run of the program:
Sample 1:
Enter numbers: 173 109 181 138 190 100 193 140 0
173 is a prime number
109 is a prime number
181 is a prime number
138 is not a prime number
190 is not a prime number
100 is not a prime number
193 is a prime number
140 is not a prime number
Explanation / Answer
PrimeTest.java
package a12;
import java.util.Scanner;
public class PrimeTest {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
System.out.println("Enter numbers: ");
int num = scan.nextInt();
while(num != 0){
if(isPrime(num)) {
System.out.println(num+" is a prime number");
} else {
System.out.println(num+" is not a prime number");
}
num = scan.nextInt();
}
}
public static boolean isPrime(int num) {
for (int f = 2; f <= num / 2; f++) {
if (num % f == 0) {
return false;
}
}
return true;
}
}
Output:
Enter numbers:
173 109 181 138 190 100 193 140 0
173 is a prime number
109 is a prime number
181 is a prime number
138 is not a prime number
190 is not a prime number
100 is not a prime number
193 is a prime number
140 is not a prime number
Related Questions
drjack9650@gmail.com
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.