3. Primes

Write a program that finds and prints all of the prime numbers between 3 and 100. A prime number is a number such that one and itself are the only numbers that evenly divide it (e.g., 3,5,7,11,13,17, …). In additional to list all prime numbers in the specified range, you also need to find the largest gap number subtract between two immediately primes. For example, 11-7=4, 13-11=2, 17-13=4 where largest gap number is 4.

One way to solve this problem is to use a doubly-nested loop. The outer loop can iterate from 3 to 100 while the inner loop checks to see if the counter value for the outer loop is prime. One way to see if number n is prime is to loop from 2 to n-1 and if any of these numbers evenly divides n then n cannot be prime. If none of the values from 2 to n-1 evenly divide n, then n must be prime. (Note that there are several easy ways to make this algorithm more efficient).

c++