Number Theory Homework Set 1.

2
Fall, 2004
Pat Rossi

Name

1.
(a)

n
k

k
r

n
r

nr
kr

2. If 2 k n 2, show that
!

n
n2
n2
n2
=
+2
+
k
k2
k1
k

3. For n 1, derive each of the identities below:

(a)
(b)
(c)
(d)
(e)
(f)

n
0

+ n1 +
a = b = 1)

n
0

n
1

+2

n
0

+2

n
0

n
0

n
1

n
2

n
2

+3

n
1

+ 22

n
2

1 n
2 1

n
4

n
3

n
n

= 2n (Here we use the Binomial Theorem, with

n
2

1 n
3 2

n
n

+ ... + n

. . . + (1)n

n
2

+ ... +

n
n

+ . . . + 2n

n
6

... +

n
5

+ ... +

n1
k

= n2n1 [Hint: n

+ ... +

= 0.

n
n

= 3n

n
n1

(1)n n
n+1 n

Hint: The left hand side equals:

n
1

1
n+1
h

n+1
1
1
n+1

n
3

n+1
2

= (k + 1)

n+1
3

n
n

n
k+1

= 2n1

. . . + (1)n

n+1
n+1

4. Prove the following, for n 1 :

(a)
(b)
(c)

n
r

<

n
r

>

n
r

n
r+1

if and only if 0 r < 12 (n 1)

n
r+1

if and only if (n 1) r > 12 (n 1) .

n
r+1

if and only if n is an odd integer, and r = 12 (n 1)

(d) For n 2, prove that

and Pascals Rule.)

2
2

3
2

4
2

+ ... +

n
2

n+1
3

(Hint: Use induction