(adsbygoogle = window.adsbygoogle || []).push({}); Computer Science Java Programming Help!!!

Determine whether or not an integer given by the user is a prime number. You may assume that the number is greater than or equal to 2. You may conditions that are in the form “if x is divisible by y” when writing your algorithm.

HINT: One way of solving this problem is to start with the assumption that the number is going to be prime. If you find at any point in your algorithm that this is not the case you should print a message saying it isn’t and then immediately exit the program (Halt). Otherwise, print a message that the number is prime at the end of your program before exiting.

NOTE: If you choose to use this algorithm for writing your program in Question 2, the Java code “((x % y) == 0)” will be true if and only if x is divisible by y (it literally means that the remainder when x is divided by y is equal to zero). It might also be helpful to know that the line of code “System.exit(0);” can be used to terminate the program at any point you wish.

my problem is:

lets say the number input is 9000203. So my algorithm would be, see if input is divisible by: 1,2,3,4,5,6??????

any help on constructing this algorithm? thanks

**Physics Forums | Science Articles, Homework Help, Discussion**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Computer Science Java Programming Help

**Physics Forums | Science Articles, Homework Help, Discussion**