__Class Schedule__

All textbook sections come from the course textbook. Your homework sets also use many problems from that textbook.

- The problem text may be recopied in homework assignments, so that you can do problems without having to keep your book open all the time.
- For more details, consult the syllabus.

Don't forget about handouts that are attached in this calendar, such as group-work solutions and HW assignments.

- Partial solution sets can instead be found on eLC.

Expect this calendar to be updated several times a week.

__UNIT 1: Fundamentals of Z, gcds, and modular congruence__

*Week 1:*

*Tues Jun 5, 2018:* Section 1.1. Introduction to basic + and * laws, recap of proof by induction.
*Wed Jun 6:* Section 1.1. Induction practice, the Binomial Theorem.
*Thu Jun 7:* Section 1.2. Divisors, Euclidean division (quotient and remainder), common divisors.
*Fri Jun 8:* Section 1.2. Euclidean Algorithm practice, linear combinations ax + by for integers x,y.

**HW 1 - due Monday Jun 11**

- Every student must hand in all the required problems. Students in MATH 6000 must do at least one challenge problem.
- Any challenge problems completed beyond this minimum are counted as extra credit.

If you're having a hard time getting the textbook, here's the first section's homework to tide you over for the moment.

*Week 2:*

*Mon Jun 11.* Section 1.2. Relatively prime numbers gcd(a,b) = 1, primes, the Fundamental Theorem of Arithmetic.
*Tues Jun 12.* Section 1.3. Congruence mod m, basic simplifications, some squares mod m.
*Wed Jun 13**.* Section 1.3. Using mods to establish contradictions, Z_m, solving linear congruences ax = b (mod m)
*Thu Jun 14.* Sections 1.3 & 1.4. Chinese Remainder Theorem, the definition of a ring.
*Fri Jun 15.* Section 1.4. Some basic ring properties of 0 and 1, units (invertible elements) and zero divisors.

**HW 2 - due Friday Jun 15**

**TEST 1 will be Wednesday June 20.**

- Expect 5 to 7 questions, similar to HW level of difficulty, for a 60-minute test.
- The first question always asks you to repeat definitions or to give very short examples.

- This test covers material from Sections 1.1 to 1.4.
- Section 2.1 won't show up on the test, but Section 1.4 will (despite not appearing on HW 1 or 2).
- Make sure to go over your graded comments on HW sets!

- Calculators will be allowed to help you do basic divisions, but you still have to show your steps for approaches like the Euclidean Algorithm.
- Here's a topic list for the test.
- Here are practice problems for the test.
- We'll have an in-class review day, to go over your open questions or the practice problems, on Tuesday June 19.

*Week 3:*

*Mon Jun 18:* Section 2.1. Ordered rings.
*Tues Jun 19:* Test 1 Review
- Review materials, such as practice problems, are located in the previous week's links.

*Wed Jun 20:* **TEST 1**
*Thu Jun 21:* Section 2.3. Basic computation in C, conjugates and magnitudes, polar form.
- HW 3 is released now, due on Tues Jun 26.

*Fri Jun 22:* Section 2.3. Using polar form and DeMoivre's Theorem to determine roots of complex numbers.

**HW 3 - due Tues Jun 26** (starts after Test 1)

__Final exam details__

Mon July 30, 2018

8:00am to 11:00am (try to show up a bit early to get yourself settled)

Boyd 323 (our usual classroom)

- This exam will cover all the material from the three in-class exams.
- Expect somewhere on the order of 12 to 14 questions, fairly similar to previous test questions. This should be around twice the length of an in-class test.

**No bathroom breaks once the test starts**. Talk to me if this is an issue.
**You'll have to leave your backpack (or similar containers) at the side of the room during the test.** Turn phones and smart watches off.

Last updated: 6/18/2018