Then, Write a program that will read in N ints, will find their max, and will check to see if that max is prime or not.  Understand how first you assume something is prime, and then have a set of potential challengers who are trying to disprove the assumption. If (any) one of them succeeds, the assumption is undermined/shattered; if none succeeds, the assumption must be true. The deep issue here is understanding how to use the logic of the prime-property (that there is no number in between 2 and N-1 that will evenly divide N) to set up a process (with a bunch of steps) that sets up a hypothesis and then will systematically provide the challengers.

THANKS

6. (11 points) Write a program that will read in and decide if a given integer is prime (a prime number is divisible by only 1 and itself)