Answered

Westonci.ca connects you with experts who provide insightful answers to your questions. Join us today and start learning! Explore thousands of questions and answers from a knowledgeable community of experts on our user-friendly platform. Join our Q&A platform to connect with experts dedicated to providing accurate answers to your questions in various fields.

Write a Java program that uses a value-returning method to identify the prime numbers between 2 bounds (input from the user). The method should identify if a number is prime or not. Call it in a loop for all numbers between the 2 bounds and display only prime numbers. Check for errors in input.Note:A number is prime if it is larger than 1 and it is divisible only by 1 and itself(Note: 1 is NOT a prime number)Example:15 is NOT prime because 15 is divisible by 1, 3, 5, and 15; 19 is prime because 19 is divisible only by 1 and 19.

Sagot :

Jamesanny20

Answer:

Answered below.

Explanation:

public int[] primeNumbers(int lowBound, int highBound){

if(lowBound < 0 || highBound < 0 || lowBound >= highBound){

System.out.print("invalid inputs");

else if(highBound <= 1){

System.out.print("No prime numbers);

}

else{

int[] nums;

for(int I = lowBound; I <= highBound; I++){

if(isPrime (I)){

nums.add(I);

}

}

return nums;

}

Thank you for trusting us with your questions. We're here to help you find accurate answers quickly and efficiently. We appreciate your visit. Our platform is always here to offer accurate and reliable answers. Return anytime. Thank you for trusting Westonci.ca. Don't forget to revisit us for more accurate and insightful answers.