MA-410 Homework 2

Due at 10:15am in class, Monday, March 12, 2007


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.

  1. Please prove for all composite integers n ≥ 4: 2n - 1 is a composite integer.
  2. FINT, §8, Problem 8.2, page 58.
  3. FINT, §8, Problem 8.3, page 58.
  4. Please use congruence theory to establish the divisibilty relation of Problem 3 on the first exam: 5 divides 33n+1 + 2n+1 for n ≥ 0.