MATH 545: Number Theory 1 

Syllabus

Andrews Chapter 1

Andrews Chapter 2-1, 2-2

Andrews Chapter 2-3, 2-4

Sieve of Eratosthenes handout

Homework

1-1: 3, 7, 13, 14

1-2: 3, 4, 5

2-1: 2, 4, 5

Above to turn in on 8/30

2-2: 2, 10

2-3: 1, 2, 7

2-4: 1, 3

3-1: 1, 2, 13

3-2: 1, 3

No class on 9/11, but here is a project to complete in lieu of class. I will collect it on 9/13 with the homework. You can get the applet at http://www.math.wvu.edu/~mays/AVdemo/AVdemo.htm

Above to turn in on 9/13

3-3: 1, 2

3-4: 1, 3

3-5: 1, 2, 4, 6 This was supposed to be 4-1, but just leave it off for now.

3-4: 5, 6

12-3: 1

12-4: 1

Above to turn in on 9/27

4-1: 1, 2, 4, 6

4-2: 4

5-1: 1, 3

5-2: 2, 9, 10

5-3: 2, 5, 6

Above won't be turned in, but will be covered on mid-term exam in class Thursday 10/4. Mid-term exam will cover through Chapter 5 section 3.

5-4: 5, 7, 8

6-1: 4, 6, 15

6-2: 1, 2, 9, 10, 11

Above to turn in on 10/18

6-3: 1

6-4: 1, 4, 14, 15

7-1: 2, 3, 4, 6

Above to turn in on 11/1

7-2: 16

8-1: 1, 2, 3, 4

8-2: 1, 2, 3

9-1: 1

9-2: 2, 3

Above to turn in on 11/15

9-3: 4, 5

9-4: 3, 4

The number 1 has two square roots in the integers mod p, for p an odd prime. How many square roots does 1 have in the integers mod n if n is a product of k distinct odd primes?

Prove that if n is a psp(2) then so is 2^n-1. Thus there are infinitely many of them.

Above to turn in on 12/6