** **

** **

**Instructor: **Dr. B. Landman

**Office: **310 Boyd

**Office Hours: **T,Th 4:30-5:30, or by appointment

**Phone: **836-6489

**E-mail: ***landman@westga.edu*

**Textbook: **Elementary Introduction to Number Theory, 3^{rd}
Edition

by Calvin T. Long; Waveland Press

**Prerequisite:**
MATH 3003

**Topics: **1. Preliminaries (Most of
Sections 1.1-1.6)

** **2. Division Algorithm
(Section 1.7)

3. Positional Notation (Section 1.8)

3. Divisibility Properties of Integers (all of Chapter 2)

4. Prime Numbers (most of Chapter 3)

5. Congruences (Sections 4.1-4.4)

6. Conditional Congruences (all of Chapter 5)

7. Sums of Squares (Chapter 7; as time permits)

__Learning Outcomes__**:**

It is expected that the student who completes this course will have acquired:

- A basic knowledge of the notion of congruences, and familiarity with the methods of solving elementary congruences (L2, L3, L4, L5, L7)
- An understanding of the statements of the following theorems, and the ability to apply them: the division algorithm, the Euclidean algorithm, Lagrange’s theorem, Wilson’s theorem, the law of quadratic reciprocity, the Chinese Remainder Theorem. (L2, L3, L4, L5, L7)
- A better understanding of the basic techniques of proving mathematical statements, including the method of mathematical induction, direct proofs, proofs by contrapositive, and proofs by contradiction. The student will demonstrate this understanding by applying these techniques to prove basic number theoretical theorems and/or facts. (L2, L3, L4, L5)
- An improvement in his or her ability to read and comprehend mathematical statements and proofs. This will be measured by having the student independently read passages and proofs containing mathematical language, in the text and in assignments, and then use these statements to draw further logical conclusions or complete mathematical proofs. (L3, L4, L5)
- An understanding of the frequency of the prime numbers via the prime number theorem. Such understanding will be demonstrated via solving problems involving limit theorems concerning the set of prime numbers. (L1, L2, L4, L7)

__Grading Procedure __**:**

**Tests : **There
will be three 50-minute tests, and a cumulative final exam. No make-up tests
will be given. If you must miss one of the 50-minute tests, your grade on the
corresponding portion of the final exam will be used in its place. If two or
more tests are missed, a grade of F will be given for all but one of the missed
tests.

**Take-home
Projects (Graded): **There will be two sets of take-home assignments, which
will be graded. Your work on these assignments is to be your own. Late papers
will not be accepted.

**Homework
(not graded): **Homework problems (that will not be graded or collected) will
be assigned regularly. These will usually be due by the next class meeting.
Although not counted toward your grade, it is ESSENTIAL to your success in the
course that you do the homework regularly, and on time. A very important part
of each homework assignment is to read the corresponding material in the text.

**Final Exam:**
There will be a comprehensive final exam.

** **

· Tests 50%

· Projects 20%

· Final Exam 30%

· An overall average of 88-100 earns a grade of A

An overall average of 77-88 earns a grade of B

An overall average of 66-77 earns a grade of C

An overall average of 55-66 earns a grade of D

An overall average below 55 earns a grade of F

**Other: **It
is **strongly recommended** that you allow at least 6-7 hours outside of
class, each week, for homework and study (more would be better).

It
is **strongly recommended** that you do not take this course if your grade
in 3003 was not C or better.

**Important Dates: **September 30, Thursday: Test 1

October 14, Thursday: Last day to withdraw with grade of W

October 28, Thursday: Test 2

November 30, Tuesday: Test 3

December 14, Tuesday: Final Exam (5:30 – 7:30 p.m.)