Tim Korb's Home Page

First, start by reading the problem statement for Carmichael Numbers.

For this prelude, you are to test the primality of the input numbers.

Input consists of a sequence of integers, n, 2 < n < 65000, one per line. The last entry is a 0, which should not be processed.

For each non-zero input value, n, determine whether n is prime, then print n, a space, and either <tt>is prime.</tt> or <tt>is not prime.</tt>.

7
10
0

7 is prime.
10 is not prime.