Due at 10:15am in class, Wednesday, March 12, 2008
Solutions may be submitted in person in class,
or you may email an ASCII text,
html, or postscipt/pdf-formatted document to me.
Note my office hours on my
schedule.
Please prove for all composite integers n ≥ 4:
2n - 1 is a composite integer.