MATH 135: Algebra for Honours Mathematics

Schedule of Topics and Reading List

Fall 2014
Math 135 will improve your reading, writing and understanding and discovery of mathematical proofs.
You will be expected to read the course notes (Reading, Discovering and Writing Proofs, RDW, 0.4.0.1)
as well as additional materials posted on the course website (LEARN).
To do well in this course, you are encouraged to attend lectures and tutorials, complete written assign-
ments and take part in in-class discussions and on piazza.
Schedule. This is a tentative schedule with topics that we plan to cover, subject to change (A = assign-
ment due Wednesday, 8:30AM). The chapters correspond to those in RDW 0.4.0.1. A complete reading
schedule is posted on the next page.
Week Dates Topics Items Due Chapters
1 Sept 8 - 12 Statements, Truth Tables, Divisibility 1 7
Implications and Direct Proof
2 Sept 15 - 19 Sets, Quantiers, A1, 8 11
Nested quantiers
3 Sept 22 - 26 Counterexamples, Contradictions, A2, 15 18,
Uniqueness, Induction
4 Sept 29- Oct 3 Whats Wrong?, Greatest Common Divisor, A3, 20, 23, 24
Primes, Fundamental Theorem of Arithmetic
5 Oct 6 - 10 Extended Euclidean Algorithm, Coprimes, Midterm 25 27,
Properties of GCD, Linear Diophantine Equations (Oct 6)
6 Oct 15-17 Congruences, Remainders A4 29 31,
Linear Congruences
7 Oct 20-24 Modular Arithmetic, A5 32 33,
Fermats little Theorem
8 Oct 27- 31 Chinese Remainder Theorem, A6 35 36
RSA Theorem and Applications
9 Nov 3-7 Complex Numbers, Modulus, Conjugate, A7 37 39
Polar Form, Graphical Representation
10 Nov 10-14 De Moivres Theorem, A8 40 42
Roots of Complex Numbers
11 Nov 17-21 Polynomials, A9 43 45,
Factoring polynomials
12 Nov 24-28 Roots of Polynomials (ctd) A10 43 45
13 Dec 1 Review A11 46
(Not handed in)
Tutorials We will be hosting three mandatory tutorial sessions on the following dates:
Monday, September 15, from 7:00 - 8:50pm,
Monday, September 22, from 7:00 - 8:50pm,
Monday, November 10, from 7:00 - 8:50pm.
You will be given more specic instructions about these tutorials on LEARN.
1
Reading You are expected to read the relevant chapters of the course notes before coming to class. The
topics covered in class are available in the course notes. Here is a detailed list of topics, sections and pages
that you are assigned to read at the end of each lecture. Some of these topics will not be covered in your
lectures, but you will be tested on the material listed here.
Additional Reading Materials may be posted on LEARN from time to time.
Lec. Reading Topics Learning Goals
Week 1
1 2.4: The Structure of a Statement Use variables and open sentences in a statement.
3.3: Truth Tables as Denitions Create truth tables to dene compound statements.
3.4: More Complicated Statements Know truth tables for , , .
3.5: Equivalent Logical Expressions Identify logically equivalent statements.
3.6: More Examples and Practice Use truth tables to solve problems.
2 4.3: Rules of Inference Use implications to make deductions
5.2: Divisibility of Integers Understand the denition of divisibility.
5.3: Analyzing a proof of TD Read a direct proof, learn the techniques, and
6.3: Discovering a Proof write a direct proof.
6.4: Proof of Bounds By Divisibility Use divisibility in direct proofs.
3 7.4 Converse and If and Only If Write the converse of an implication.
7.5 Practice B = A A = B
Dene using truth table.
Connect with logical equivalence.
Learn to prove If and Only If statements.
Solve all practice problems.
Week 2
4 8.3: (pags 68 - 69) Finding the elements of S T, S T, S T.
Set Operations - Unions, Intersection Understand S T, S T, S T
and Set-Differences using set builder notation.
8.4: (pages 70 - 72) Dene S T using set builder notation.
Cartesian Product of Sets Recognize S T = T S.
Differentiate S S from the diagonal set.
8.2 (pages 73 - 76) Comparing Sets Learn to prove S T.
8.3 (pages 77 - 79) Understand the concept of a power set.
Showing Two Sets Are Equal Use mutual inclusion to prove S = T.
8.4 and 8.5 (pages 79 - 81) Read all examples and solve all practice problems.
5 9.2: Quantiers Understand the role of quantiers in a statement.
9.3: The Universal Quantier Learn to use the Select Method.
9.4: The Existential Quantier Learn to use the Construct Method.
9.5: Negating Quantiers Negate a quantied statement without using .
6 9.3: The Universal Quantier Learn to use the Substitution Method.
9.4: The Existential Quantier Learn to use the Object Method.
10: Nested Quantiers Prove implications with quantiers.
(pages 98 - 104) Entire Chapter Importance of the order of nested quantiers.
11: More on Quantiers Investigate proof methods to nested quantiers.
(pages 105 - 117) Entire Chapter Negate statements with more than one quantier.
Read all examples and solve all practice problems.
Continued on the next page
2
Lec. Reading Topics Learning Goals
Week 3
7 15.2 Review of the Negation Rules Proposition RON (page 150) in its entirety.
15.3: Proof by Contradiction Go through all examples for negations,
counterexamples and generalization.
The concept of a contradiction and
when to use Contradiction.
How to write a proof by contradiction.
Read and analyze the proof of PF and INF P.
8 16: Uniquneness Uniqueness as a concept
(pages 160 - 165) Entire Chapter Demonstrate uniqueness by showing X = Y
or by nding a Contradiction.
16.5: The Division Algorithm Analyze the proof of DA.
17.2: Notation Read about the Summation Notation,
the Product Notation and Recurrence Relations.
9 17.4: Principle of The statement of POMI
Mathematical Induction Use POMI to prove statements.
(pages 170 - 179) Read all examples and solve all practice problems.
18.2: Strong Induction The statement of POSI
(pages 183 - 189) Differentiate POSI from POMI
Read all examples and solve practice problems.
Week 4
10 20: Whats Wrong? Identify wrong steps in an incorrect proof.
(pages 196 - 203) Entire Chapter Avoid common mistakes in writing a proof.
11 23.2: Greatest Common Divisor Analyze GCD with Remainders (page 220).
24.4: Fundamental Theorem Using Prime Factorization to calculate GCD.
of Arithmetic Using Prime Factorization to nd divisors.
24.5: Finding a Prime Factor Read proof of FPF.
12 24.6: Working with Prime Proof of DFPF and GCD PF
Factorizations will be available on LEARN.
Week 5
13 23.3: Certicate of Correctness Prove GCD CT
23.4 and 23.5 Read all examples and solve all practice problems.
25: The Extended Euclidean Read the EEA Algorithm.
Algorithm (pages 238 - 242) Use EEA Algorithm to calculate GCD.
14 26.2: Some Useful Propositions Denition of coprime.
(pages 243 - 248) Prove CAD and PAD
Properties of GCDs Learn to use GCD CT and GCD OO
Learn to use EEA theorem and prove DB GCD.
15 26.3 and 26.4 Read all examples and solve all exercise problems.
Know when to use GCD CT.
Know when to use EEA theorem.
The difference between GCD CT and EEA theorem.
Week 6
16 28.2: Finding all Solutions Read the Analysis of the proof of LDET 2
to ax +by = c pages 256 - 260.
17 28.3 and 28.4 Read all examples and solve all practice problems.
Continued on the next page
3
Lec. Reading Topics Learning Goals
Week 7
18 29.2: Congruences Dene modular congruence using divisibility
29.3: Elementary Properties Analyze the proofs of CER and PC
Prove CD using CAD.
30: Congruence and Write the proof of CISR
Remainder (pages 272 - 26) Read all examples and solve all practice problems.
Additional Reading posted Read about Equivalent Relations
on LEARN and modular reduction on LEARN.
19 32.2: Modular Arithmetic Dene congruence classes.
(pages 285 - 286) Determine existence of Inverses in Z
m
32.4: Linear Congruences and Finding multiplicative inverses in Z
m
.
Modular Classes Congruence classes vs. modular congruence.
Additional Notes on LEARN Understand how to obtain LCT 2.
20 33.2: Fermats little Theorem Understand the proof of FlT.
33.3 and 33.4 Read all examples and solve all practice problems.
Week 8
21 34: Chinese Remainder Read all examples (pages 297 - 303).
Theorem Write a proof GCRT.
What happens when the moduli are not coprime.
35: Practice, Practice, Practice How to solve polynomial congruences
- Congruences with the help of CRT and FlT.
22 35.4: Preparing for RSA Solve the problem in 35.4.
36.3: Why Public Key Historical development and signicance
Cryptography of RSA (additional reading on LEARN).
36.4: Implementing RSA Learn how to set up RSA.
How to send and receive messages using RSA.
23 36.5: Does M = R? Understand the proof of RSA theorem.
37.3 Complex Numbers Dene a complex number in its standard form.
Identify real and imaginary parts of a complex number.
Learn to add and multiply complex numbers.
Divide complex numbers using multiplicative inverse.
Week 9
24 38.3: Modulus Dene the modulus of a complex number.
38.4: More Examples Prove all the Properties of Modulus, PM.
38.5: Practice Read all examples and solve all practice problems.
25 39.4 Converting between Read the proof of PMCN proposition 1, page 344.
Representations Read Example 3 page 344.
26 40: De Moivres Theorem Go through all the examples in chapter 40.
41.2: Complex n-th Roots Read the proof of CNRT.
Week 10
27 42: Practice, Practice, Practice Go through all the examples in Chapter 41 and 42.
- Complex Numbers Read Examples posted on LEARN.
28 No Reading
29 43.3: Operations on Understand polynomial multiplication
Polynomials and long division.
Week 11
30 44: Factoring Polynomials Read the proof of RT and prove FT.
Use induction to prove CPN.
31 Additional Notes on LEARN What is complete factorization?
32 45: Practice, Practice, Practice Learn to nd all the roots of a polynomial.
- Polynomials Use the roots to nd factors of a polynomial.
Week 12
33 No reading
34 Practice, Practice, Practice Summarize the course.
- Course Review Solve all the exercise problems.
End of Reading Schedule
4