Answered

Westonci.ca makes finding answers easy, with a community of experts ready to provide you with the information you seek. Our Q&A platform provides quick and trustworthy answers to your questions from experienced professionals in different areas of expertise. Connect with a community of professionals ready to help you find accurate solutions to your questions quickly and efficiently.

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;

}

Thanks for using our platform. We aim to provide accurate and up-to-date answers to all your queries. Come back soon. We appreciate your time. Please revisit us for more reliable answers to any questions you may have. We're glad you visited Westonci.ca. Return anytime for updated answers from our knowledgeable team.