Practice Programming Challenge #1 A prime number is a whole number greater than 1 whose only factors are 1 and itself.  A factor is a whole number that can be evenly divided into another number.  The first few prime numbers are 2, 3, 5, 7, 11, 13, 17, 19, 23, and 29.  The number 1 is not prime. Create a java application that allows the user to repeatedly enter a number to find out it is a prime number. The program should: · Prompt the user for a number greater than 1 · Print out if the number is a prime number or not · Then ask the user if they would like to enter another number or quit See sample below: In addition, your program should also contain and demonstrate a method isPrime.  This method should: · Take in one int as an argument · Return a boolean – true if the argument is prime, false if argument int is not prime The main method of the program should call the isPrime method to determine if the number entered by the user is prime.

Prime numbers play a significant role in mathematics as they have unique properties and are fundamental to many areas of study, including cryptography and number theory. A prime number is defined as a whole number greater than 1 that has no divisors other than 1 and itself. In other words, a prime number cannot be evenly divided by any other number.

The task at hand is to create a Java application that allows the user to repeatedly enter a number and determine whether it is a prime number or not. The program will prompt the user for a number greater than 1, and based on the user’s input, it will output whether the number is prime or not. Additionally, the program should give the user the option to enter another number or choose to quit.

To achieve this functionality, it is important to implement a method called isPrime, which takes an integer as an argument and returns a boolean value. This isPrime method will be responsible for determining whether a given number is prime or not, utilizing the definition of a prime number mentioned earlier.

The main method of the program will call the isPrime method and pass the user’s input as an argument to check if it is prime. Based on the returned boolean value, the program will inform the user whether the input number is prime or not.

By utilizing the isPrime method, the program can repeatedly prompt the user for a number, determine its primality, and display the result. This will be achieved by implementing a loop structure that allows the program to repeat the process until the user chooses to quit.

In summary, the Java application will prompt the user for a number and check whether it is a prime number or not. It will leverage the isPrime method, which determines the primality of a given number based on the definition of prime numbers. The program will continue to ask the user for inputs and display the results until the user decides to quit. This approach allows for a user-friendly and efficient way to explore the concept of prime numbers through programming.