Math 306
Fall 2007
Section 01 8:40 am - 9:30 am MWF
MG 120
[home] [assignments] [diary][office hours][Examinations][Extra Credit Problems][Elementary open problems]
Course Description
Catalog Description
MATH 306 Number Theory (3-0-3)(F) Diophantine equations, modular
arithmetic, quadratic reciprocity, primality testing and factoring
methods.
PREREQ: MATH 175 and MATH 187.
MATH 175 Calculus and Analytic Geometry and MATH 187 Discrete and Foundational Math, or equivalent courses elsewhere, or permission of the instructor. The rationale for these prerequisites is that Number Theory requires a level of Mathematical maturity which could be attained through these two lower division courses.
This course is not currently controlled by a departmental committee and individual instructors may choose different textbooks. Exams, homework, and grading system are left to the instructor.
As a course in Mathematics, the objectives of MATH 306 include that students be able to:
Currently this course is taken mainly by mathematics majors.
Upon completion of this course, students should be able to:
Students will be assessed by evaluating their ability to do problems based on the learning objectives. The problems may occur in several contexts:
The following table is based on a typical semester schedule - 45 class meetings
of 50 minutes each. The actual amount of time spent on each topic will vary
slightly from semester to semester and instructor to instructor.
| M 306 Number Theory | |
| Number of | |
| Topic | Meetings |
| Pythagorean triples | 2 |
| Greatest Common Divisor and Euclidean Algorithm | 3 |
| Fundamental Theorem of Arithmetic | 2 |
| Modular Arithmetic and Linear Equations | 3 |
| Modular Arithmetic and Exponentiation | 5 |
| The infinitude of the prime numbers | 2 |
| Primitive roots and the Discrete Log Problem | 4 |
| Modular Arithmetic and Square roots | 2 |
| The Quadratic Reciprocity Theorem | 4 |
| Sums of squares | 4 |
| Pell's Equation | 2 |
| Elliptic Curves | 6 |
| Primality tests | 3 |
| Factoring algorithms | 3 |
| Exams | 2 |
| Total | 47 |
The current text is A Friendly Introduction to Number Theory (third edition), Joseph H. Silverman, Prentice Hall (2006).
The following websites offer valuable learning materials for this course:
Class meetings involve a combination of lecture, questions and discussion,
and sometimes small group activity; the instructor chooses the appropriate mix.
The computer algebra system, MAPLE™, is used for laboratory activities
and homework. Homework is an important part of the course; many exercises
involve extensions of ideas in the text to new situations, rather than just
routine applications. Some exams may be partially take-home. The instructor
chooses the exact grading scheme, but a typical distribution might be:
| Homework (including a writing assignment and project) | 33 1/3 % |
| Exams | 33 1/3% |
| Final Exam | 33 1/3% |
| Total | 100% |
Letter grades are based on a scale in which 90% of the total possible points guarantees an A, 80% a B, 70% a C, and 60% a D, with the instructor having the discretion to lower these cut-offs if warranted.
(Adapted from: Department of Mathematics Generic Syllabus,
Boise State University. Updated Fall, 1998)
Point-values represented by graded activities:
Homework 200 points
1 test
100 points
Final Examination 200 points
Letter grade scale
|
- |
|
+ |
|
|
A |
90 - 92.4 |
92.5 - 97.4 |
97.5 - 100 |
|
B |
80 - 82.4 |
82.5 - 87.4 |
87.5 - <90 |
|
C |
70 - 72.4 |
72.5 - 77.4 |
77.5 - <80 |
|
D |
60 - 62.4 |
62.5 - 67.4 |
67.5 - <70 |