Name: Math 218-02 Fall 2011 1.

Prove that Exam #2

Wednesday, November 30, 2011

1 1 n 1 + + + = for all n Z+ . 12 23 n(n + 1) n+1

2. Find the values of the following sums:

30

(a)
k=10

4(2)k

30

(b)
k=1

(2k 2 8k + 5)

3. Find a mod b for the following values of a and b: (a) a = 86, b = 17

(b) a = 17, b = 86

(c) a = 86, b = 17

4. Prove that the set S = {x Z : x 5 and x is odd} is countable.

5. Prove or disprove: if a|m and b|m, then (a + b)|m.

6. Prove or disprove:
i=m

ak = i
i=m

ai

, where k is a real number.

7. Let a, b, c, m Z with m > 0. Prove using the denition of congruence modulo m that if a b (mod m) and b c (mod m), then a c (mod m).

8. Bonus: Prove by induction that 4|(5n 1) for all n Z+ .

Formulas
n

i = 1 + 2 + 3 + + n =
i=1 n

n(n + 1) 2 n(n + 1)(2n + 1) 6

i2 = 12 + 22 + 32 + + n2 =
i=1 n 3 3 3 3 3

i=1 n

n2 (n + 1)2 i = 1 + 2 + 3 + + n = 4 ari = a rn+1 1 r1

i=0