Proof for Feedback:
Another induction: Hamkins (not Hammack), Chapter 4, exercise 4.4: prove that for integers , we have where is the n-th Fibonacci number.
- I don’t get the sense that the class was feeling good about induction on the quiz. I’m slightly changing the wednesday quiz schedule, so this coming wednesday will be another chance at an induction proof (grading will be updated so you get best 4 of 8 proofs instead of best 4 of 7).
- Read Hamkins (not Hammack), Chapter 4 (you may optionally skip the “Buckets of Fish” part), and do the proof for feedback above.
- Do some of Hamkins’ Chapter 4 exercises.
- Study induction.
- For those who missed Friday’s class, there’s a video on canvas, plus info as usual at “Materials Archive” above.
Proof for Feedback:
modular arithmetic (do this after tasks 1 & 2 below)
- Watch my video about Modular Arithmetic (9:22). It repeats some of what we did in class Wednesday, but repetition is a tried-and-true method of learning. 🙂
- Do the associated practice-sheet (answer key at the back).
- If time remains, watch the next follow-up video (17:26). This covers why addition and multiplication are well-defined (in other words, why they “work” mod n).
- Don’t forget that if you want to do a logic grade improvement, I’d like your study sheet by Friday.
Have a happy and restful spring break. Video links for Friday’s video lecture are below. Your homework over break will be to read Hamkins (not Hammack), Chapter 4 up to the end of Section 4.3 (pages 27-32) about induction, and to watch the Friday lecture videos. Just spend some time thinking and absorbing, nothing to hand in.
Video 1 (19 mins) is hosted on google drive, and I made it for you today, showing a standard inductive proof: view it here.
Video 2 (22 mins) is hosted on YouTube and I made it in 2018 showing a graph-based inductive proof: view it here. (I apologize that I can’t find my original file from 2018 and have to give a YouTube link, which may serve you an ad that Youtube makes money from. 🙂
Proof for feedback:
State and prove a variation on today’s Take-2-or-1 Theorem, but where players can take 1 or 3 stones. Use as a model the proof from class notes and/or my writeup.
- Note: Friday, March 24th will be a recorded lecture (so no need to attend class); you will find it on this website and view it over spring break at your leisure.
- Wednesday is a proof quiz. It will be a proof by contrapositive. Examples can be found in Chapter 5 of Hammack. Do some exercises from there as practice.
- Because of spring break, you will have until April 7th to do a logic study sheet in order to request a logic grade improvement. Solutions to the quiz can be found in the “Materials Archive” page as usual.
Proof for feedback: Revisit any of your previous proofs for feedback and resubmit a new draft based on your previous feedback. Pick one that you struggled with the first time around.
- Your logic test is on Wednesday. I will post some example/practice problems shortly on here (watch this spot).
- Watch this description of the limit definition of a sequence; this should help clarify some of what we were doing in class:
- Video 1: https://www.youtube.com/watch?v=PRTjvMA2nCY
- Video 2: https://www.youtube.com/watch?v=0UCRZAsIkXM
- Video 3: https://www.youtube.com/watch?v=lCW8BBBQRyc
- See if you can finish the rest of limit part (first two pages) of the worksheet from Friday.