Reading Assignment: Sections 3.3, 3.5, 3.6 (you are more than welcome to also read 3.4).
Homework 2 (due on Thursday Feb 3rd, 2022 at 11:59pm):
Knowledge is off. You can use any fact that has been proved before the exercise (including prior exercises in the book), unless the exercise asks you to prove a Theorem/Lemma/Proposition, in that case you can use any fact before the Theorem/Lemma/Proposition.
If you are asked to prove item (d) in a proposition, you can use prior items (a), (b), and (c).
- Section 2.2: Exercise 2.2.2 (existence of a predecessor for positive natural numbers).
- Not in the book: Let a, b, c, d be in N, if a < b and c< d then a+c < b+d (can use anything in Section 2.2 or before).
- Section 2.3: Exercise 2.3.2 (N has no zero divisors).
- Section 2.3: Exercise 2.3.5 (Euclidean Algorithm, show also uniqueness, not just existence).
- Not in the book: use truth tables to prove the distributive property for OR and AND, that is if p, q, r are statements then p or (q and r) <=> (p or q) and (p or r)
- Bonus: Prove Proposition 2.2.12(e): if a< b then a++<=b.
Reading Assignment: Sections 2.3, 3.1 (sets) and 3.3 (functions) (you are more than welcome to read also Section 3.2 (Russel Paradox) I will not lecture on this however).
Homework 1 (due on Thursday Jan 27, 2022 at 11:59pm)
For the first two problems turn on your number knowledge, for the last two problems turn it off:
- Show by induction that for all n natural numbers
0+1+4+9+16+...+ n^2 = n(n+1)(2n+1)/6.
- Show by induction that n^2 <= 2^n for all natural numbers n>=4.
(you will need at some point to show that 2n+1<=2^n for n>=4, or to show that
n^2>= 2n+1 for n>=4 depending whether you go right to left or left to right in your inequality, that will be an auxiliary lemma that you may prove by induction! in fact these auxiliary inequalities are true for n>=3).
- Show that for all n in N, 1+n=n++ . Then show that 1+1=2.
- Show that multiplication in N is commutative, that is nxm=mxn for all n,m in N
(Exercise 2.3.1 in the book).
Hint: prove it by induction on n for each m fixed, and you will need two auxiliary lemmas similar to those
used when proving commutativity of addition in class.
Reading Assignment Chapter 2.
Return to: Department
of Mathematics and Statistics, University
of New Mexico
Last updated: Jan 17, 2022