|Lectures||MWF 11:10–12:00, Physics Building 385|
|Office Hours||MWF 12:10–1:00 and MWF 3:10–4:00, excluding University
If you cannot make these times, then please email me to set up a different time to meet.
|Prerequisites||Math 55 is recommended|
|Required Text||Niven, Zuckerman, Montgomery,
An introduction to the theory of numbers, Wiley, 5th edition
Here are some links that you may find useful if you do not have the most recent printing of the textbook.
|Catalog Description||Divisibility, congruences, numerical functions, theory of primes. Topics selected: Diophantine analysis, continued fractions, partitions, quadratic fields, asymptotic distributions, additive problems.|
As currently planned, the following parts of the book will be covered:
Chapter 1 - Divisibility
Chapter 2 - Congruences
Chapter 3 - Quadratic Reciprocity and Quadratic Forms
Chapter 4 - Some Functions of Number Theory
Chapter 7 - Simple Continued Fractions
Plans are subject to change.
|Grading||Grading will be based on:
All exams (including the final) will be held in our regular classroom (Physics Building 385) unless otherwise announced.
|Homework||Assigned weekly, generally due on bCourses at 11:59 pm on Mondays. Assignments are given below. Solutions will be posted on bCourses.|
|Resiliency Plans||If necessary (e.g., because of pandemic conditions or poor air quality), we may switch to holding class via Zoom. If this becomes necessary, details (including the meeting link) will be announced on bCourses.|
General rules on homework assignments are:
Homework assignments are due on bCourses on the days indicated below. The lowest three homework scores will be dropped (note that homework scores include two additional scores from clickers—see the section on Clickers, below).
|1||9/3||1.2||1c, 2, 3d,e, 14, 19, 21, 26||For 3d and 3e, use a method that would be still be practical if
the coefficients were replaced by much larger numbers.|
For 19, assume that the set is finite and has at least two elements.
|2||9/13||1.2||43||Remember not to use prime factorizations when solving this one.
You may assume that a, b, and c are nonzero.
|1.3||6, 14, 16, 19, 20||The book often writes (b,c) in place of gcd(b,c).|
|1.4||2, 4, 6, 9|
|3||9/20||2.1||2, 6, 8, 12, 18, 20, 27, 40, 44, 51, 59||In 18, p is prime.|
|2.2||6, 8, 9, 14||Exercise 14 has a hint on page 504 (this is what the notation
“(H)” means in the statement of the exercise).|
Also, do not use de Polignac's formula (Theorem 4.2) to do Exercise 14. That formula occurs on page 182, and we haven't covered it yet.
We will use iClickers in class. These must be the physical iClickers, not the iClicker app. The latter is not allowed, because use of cell phones during class can be very distracting.
iClickers can be obtained from the bookstore, or you may be able to buy a used one from another student.
The grades from iClicker use will be incorporated into the homework portion of the course grade.
Clicker grades will be determined as follows. For each class day (other than the first two), you will receive one clicker point for participation if you have provided answers (correct or not) to at least 50% of the clicker questions on that day, and one clicker point for correctness if you answer at least one clicker question correctly on that day. These will be reported to bCourses separately, but will be combined for the purposes of the next steps.
I will then drop the lowest four sessions (class days), and then combine that information with the homework scores by creating two ``fake'' assignment scores based on the total clicker scores.
The clicker points are not meant to be a big challenge. The vast majority of you should be receiving two clicker points on every day that you attend. The point of clickers is that you should be checking your own understanding of the material (including the reading) as the course progresses.
The clicker grading plan is subject to change.
|1||August 27||Proof of the Existence of the Greatest-Integer Function
(revised August 28 to reflect the proof given in class)
|2||August 27||Equivalence of three types of induction||dvi|
|3||September 1||Slides from Lecture of September 1||dvi|
|4||September 20||Slides from Lecture of September 20||dvi|
|5||September 22||More complicated congruences||dvi|
Policies for exams are as follows.
One more thing. If you are computing gcd(a,b) or finding x and y such that gcd(a,b)=xa+yb, and if |a|<20 and |b|<20, then you can use any method you want and don't have to include the details. If |a| or |b| is at least 20, though, you are expected to use the Euclidean Algorithm and to show your work.
The two midterms will be given during the normal class hours (11:10–12:00), and will be in our normal classroom (Physics 385).
Generally, about a week before each exam, a sample exam will be distributed in class and posted on bCourses. This will usually be an exam from an earlier Math 113 class that I've taught. Sample exams should be used to get a general idea of the likely length of an exam and the general nature of questions to be asked (e.g., the balance between computational and more theoretical questions). However, one should not (for example) observe that a sample exam contains questions on material from Sections 1.5, 2.1, 2.7, 3.1, 3.4, etc., and expect to see questions from those sections on the actual exam.
Exams are cumulative, so the second midterm may have questions from material prior to the first midterm. Of course, the final exam will cover the whole course, but will have increased emphasis on the material not covered on the midterms.
Here is a link "How to lose marks on math exams" (by a former GSI Andrew Critch).
The Math Department maintains an archive of old exams (usually without answers). Here is the link for Math 115.
And finally, a word about regrades: Grade calculation errors are welcome for discussion or review. Whether this solution should be worth 4 or 5 points is not.
Last updated 22 September 2021