MAS
3203
.01
Number Theory
Spring
2001
, 4
credit hours
|
| INSTRUCTOR | Dr.
Heath Martin
|
| OFFICE | MAP 231F
|
| OFFICE HOURS | MTW 4:00pm - 5:30pm
|
| PHONE | (407) 823-5700
|
| EMAIL | martin@math.ucf.edu
|
| CLASS LOCATION | MAP 407
|
| CLASS TIMES | MW 5:30pm-6:45pm
|
| TEXTBOOK | Elementary Number Theory, 4th Edition
|
| by | David M. Burton
|
ATTENDANCE POLICY Regular attendance to lectures is an important part of this course. Students are expected to attend class each day, and to stay in the classroom for the entire lecture period. Attendance records will be kept.
|
HOMEWORK Daily homework exercises will be assigned. I will periodically collect and grade these. It is highly recommended that students attempt every exercise in the covered sections.
|
TESTS There will be four midterm tests and a final examination. The midterm tests are scheduled on the following dates: January 29, February 19, March 21, and April 11. These dates are subject to minor alterations to accommodate the lecture schedule. The final exam date is given in the Schedule Book as Monday, April 30, 4:00pm--6:50pm. It will be held in the usual classroom.
|
GRADING POLICY Course grades are computed according to the following table: Homework (15%), Midterm Tests (65%),Final Exam (20%)Students who do not take the final exam will fail the course. There are no plus/minus grades and no grades of NC, S, or U.
|
| GRADING SCALE | | Average | Grade | | 90 - 100%
| A | | 80 - 89%
| B | | 70 - 79%
| C | | 60 - 69%
| D | | 0 - 59%
| F | |
IMPORTANT DATES Spring 2001 Classes Begin Jan.8; Late Registration and Add/Drop Jan.9-12; Application for Grade Forgiveness Deadline Jan.12; Fees Due and Last Day for Full Refund Jan.12; Withdrawal Deadline Mar.2; Classes End; Last Day to Remove Incomplete Apr.23; Final Examination Period Apr.24-30; Grades Due in Registrar's Office May 3; Grades Available on POLARIS and TouchTone May 4, after 9 a.m.; Commencements May 4-5
|
TENTATIVE LIST OF TOPICS Mathematical induction, divisibility of integers, division algorithm, gcd's, Euclidean algorithm, prime numbers, prime factorization, distribution of primes, congruences, Fermat's Little Theorem, Wilson's Theorem, number-theoretic functions, Euler's Phi-function. Time permitting, we may also discuss other topics such as perfect numbers, Fermat's Last Theorem, and the Fibonacci numbers.
|
OTHER INFORMATION Completion of MHF2300 (Logic and Proof) or its equivalent is a required prerequisite for this course. Students are responsible for ensuring that they have satisfied the prerequisites for this course.
|
CLASS WEB PAGE http://math.ucf.edu/~martin/MAS3203
|