%%% Assignment 6
%%% Extra Credit
%%% Out: Mon 5 Nov
%%% Due: Mon 12 Nov 
%
% This assignment is to be turned in on paper.
%
 
1. (25 pts) Show that the proof that there are infinitely many primes
discussed in section of the notes on classical versus constructive logic
provides an algorithm for finding a prime number greater than N. 
Is it a good algorithm?

2. (25 pts) Show that for any number N, there is a prime number between
N and N! + 1.

%%%
%%%
%%%