Due date: Thursday, March 25, 2004.

Ex. 1 Write a program that inputs an integer number and decides whether it is a prime number or not. Remember that a prime number has exactly 2 divisors: 1 and itself. The numbers 0 and 1 are not prime numbers. For this, you will have to implement 2 functions:

• the first one counting the number of divisors of an integer number; this function takes one integer parameter and returns an integer.
• the second one that decides if a number is prime or not; this function must call the first one to count the number of divisors; this function takes one integer parameter and return a Boolean (bool).

Ex. 2 (5 extra credit points) Rewrite the function that decides if a number is prime without counting the divisors. For this function, use a for loop starting from 2 and going at most to the square root of the number until it encounters a divisor. If that divisor is equal to 1, then the number is prime (use a return statement to interrupt the loop and get out of the function). You will have to use the function sqrt from the library. See pages 136-140 from the textbook.

Note. If you turn in only one of the two exercises, it is worth 20 points.