Directions: Solve the following problems. All written work must be your own. See the course syllabus for detailed rules.

  1. Prove that for every nonnegative integer n, we have k=1nk2 = [(2n + 1)(n + 1)n]6.
  2. Recall that n! = 1 2 n. For n 0, find a formula for 1 + k=1nk k! and prove your formula is correct.
  3. The adjusted Fibonacci sequence F^n is given by F^0 = F^1 = 1 and F^n = F^n1 + F^n2 for n 2. (Note that F^2 = F^1 + F^0 = 1 + 1 = 2, and F^3 = F^2 + F^1 = 2 + 1 = 3.) Prove that for n 0, we have F^n ϕn, where ϕ = (1 + 5)2.
  4. A unit fraction is a rational number of the form 1n for some positive integer n. An Egyptian fraction is the sum of zero or more distinct unit fractions. For example, 29 45 is an Egyptian fraction since 29 45 = 1 4 + 1 5 + 1 9 + 1 12. Although 11 12 = 1 3 + 1 3 + 1 4, this is not enough to establish that 11 12 is an Egyptian fraction since the unit fractions are not distinct. However, 11 12 = 1 2 + 1 4 + 1 6 does establish that 11 12 is an Egyptian fraction.

    1. Let a and b be nonnegative integers with 0 < a < b, and let n be the smallest positive integer such that 1 n a b. Prove that a b 1 n = c d for some nonnegative integers c and d such that c < a and c d < 1 n.
    2. Prove that if a and b are nonnegative integers with a < b, then a b is an Egyptian fraction.

    Comment: with part (b) and the fact that the Harmonic series 1 + 1 2 + 1 3 + diverges, one can show that every nonnegative rational number is an Egyptian fraction.