Instructor | Paul Vojta | |||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Lectures | TuTh 9:40–11:00 am, Wheeler 102 | |||||||||||||||
Class Number | 24103 | |||||||||||||||
Office | 883 Evans | |||||||||||||||
vojta@math.berkeley.edu | ||||||||||||||||
Office Hours | Up to and including RRR Week: TuTh 11:30–1:00,
excluding University holidays. During Finals Week: To be announced. | |||||||||||||||
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. The textbook is available for loan from our library. Here is the link for the book in UC Library Search. From there, you can view it online, using UC BEARS (note: there are many restrictions). | |||||||||||||||
Catalog Description | Divisibility, congruences, numerical functions, theory of primes. Topics selected: Diophantine analysis, continued fractions, partitions, quadratic fields, asymptotic distributions, additive problems. | |||||||||||||||
Syllabus |
The following parts of the book are planned to 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 | |||||||||||||||
Grading | Grading will be based on:
All exams (including the final) will be held in our regular classroom (Wheeler 102) unless otherwise announced. | |||||||||||||||
Homework | Assigned weekly, generally due on bCourses at 11:59 pm on Thursdays. 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. | |||||||||||||||
Comments |
|
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 iClickers, below).
No. | Due | Section | Problems | Comments |
---|---|---|---|---|
1 | 9/9 | 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/16 | 1.2 | 43 | Do not 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/23 | 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. | ||
4 | 9/30 | 2.3 | 4, 7, 14, 16, 17, 20 | For #4, use a method that would work with much larger numbers in place of 1, 2, 3 and 3, 4, 5. Also (in #4), when using the Euclidean algorithm, you may just say “Euclidean Algorithm” and leave out the details. |
2.4 | 6, 9, 10 | |||
2.5 | 1, 2, 4 | For #4 (and for other exercises in the book), the notation “(H)” means that there is a hint in the back of the book (pages 503–511). | ||
2.6 | 1, 3 | For #3, use Hensel's lemma whenever possible or show that it would not help. | ||
5 | 10/9 | Download: dvi pdf | ||
6 | 10/16 | 2.7 | 1a, 2, 7 | In #7, show that Theorem 2.28 is false for all composite m. |
2.8 | 2, 3, 6, 9, 10, 11 | |||
7 | 10/23 | Download: dvi pdf | ||
8 | 10/30 | 3.1 | 3, 7, 11, 12, 14, 15 | Be sure not to use methods from Sections 3.2 or 3.3. |
3.2 | 6, 7, 8, 18 | Be sure not to use methods from Section 3.3. In #18, replace 1111111111111 with 1111118111111 (1111111111111 is not prime). (This change has already been made in recent printings of the textbook.) | ||
3.3 | 1, 2, 4, 6 | |||
9 | 11/6 | 3.3 | 7, 8, 15, 21 | |
3.4 | 1, 3, 8, 10 | |||
3.5 | 1, 3, 11 | |||
10 | 11/18 | 3.5 | 5, 6, 12 | The first sentence of #5 should read, “Show that ... are the only reduced positive definite quadratic forms ...” |
3.7 | 1, 2, 3, 5 | For #3, do only the first two sentences. In other words, you don't
need to compute rf(n). Feel free to look at Section 3.6 for ideas. | ||
4.1 | 2, 3, 4, 6 | |||
11 | 11/25 | 4.1 | 9, 16 | |
4.2 | 5, 6, 11, 12, 16 | |||
4.3 | 1, 2, 5, 8 | |||
7.1 | 1, 4, 5 | |||
12 | 12/4 | TBA | ||
13 | Do not hand in |
TBA | Solutions will be posted on bCourses. |
We will use iClickers in class. You may use the iClicker Cloud app (preferred), or the older physical iClickers.
Physical iClickers can be obtained from the bookstore, or you may be able to buy a used one from another student.
Links:
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 one or 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 three 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 students should be receiving two clicker points on every day that they attend. The point of clickers is that students should be monitoring their own understanding of the material (including the reading) as the course progresses.
The clicker grading plan is subject to change.
No. | Date | Title | Download | |
---|---|---|---|---|
1 | September 3 | Proof of the existence of the greatest-integer function | dvi | |
2 | September 19 | Three types of induction | dvi | |
3 | September 24 | Slides from the lecture of September 24 | dvi | |
4 | September 26 | More complicated congruences | dvi | |
5 | October 1 | The stronger general Hensel's Lemma | dvi | |
6 | October 3 | Slides from the lecture of October 3 | dvi | |
7 | October 20 | Primitive roots (revised October 20) | dvi | |
8 | October 29 | Slides from the lecture of October 29 (corrected) | dvi | |
9 | October 29 | A rephrased Theorem 3.10 | dvi | |
10 | October 29 | Basic information on matrices | dvi | |
11 | November 4 | Slides from the lecture of October 31 (corrected) | dvi | |
12 | November 5 | Slides from the lecture of November 5 | dvi | |
13 | November 7 | Slides from the lecture of November 7 | dvi | |
14 | November 19 | Slides from the lecture of November 19 | dvi | |
15 | November 21 | Slides from the lecture of November 21 | dvi | |
16 | November 21 | More slides from the lecture of November 21 (revised) | dvi | |
17 | November 26 | Slides from the lecture of November 26 | 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 (9:40–11:00 am), and will be in our normal classroom (Wheeler 102).
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 115 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.
The first midterm was given on Tuesday, October 8, from 9:40 to 11:00 am Pacific Time, in our usual classroom (Wheeler 102).
It covered:
As noted under the heading “Exams (Generally),” this was a fully closed-book exam.
A sample midterm was distributed in class on October 1, and is available on bCourses. Solutions to the sample midterm have also been posted on bCourses.
Solutions to the midterm itself are also now available on bCourses.
The (very rough) curve for the midterm is:
A | 66–73 |
B | 55–65 |
C | 38–54 |
The median was 58, the mean was 52.8, and the standard deviation was 17.15.
The second midterm was given on Thursday, November 14, from 9:40 to 11:00 am Pacific Time, in our usual classroom (Wheeler 102).
It covered:
As noted under the heading “Exams (Generally),” this was a fully closed-book exam.
A sample midterm was distributed in class on November 7, and is available on bCourses. Solutions to the sample midterm are also available on bCourses.
Solutions to the midterm itself are also now available on bCourses.
The (very rough) curve for the midterm is:
A | 62–92 |
B | 48–61 |
C | 30–47 |
The median was 52, the mean was 49.6, and the standard deviation was 22.0.
Last modified 26 November 2024