Induction

From Computer Science
Revision as of 15:12, 5 October 2022 by Jkinne (talk | contribs) (Created page with "==Assignment== # See the proof related to tiling from the Induction (II) page in the OneNote notes (in the Proofs section). Consider an 8x8 board with the "red" or missing s...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Assignment

  1. See the proof related to tiling from the Induction (II) page in the OneNote notes (in the Proofs section). Consider an 8x8 board with the "red" or missing square being the one in the lower right corner. Show how the proof by induction would construct a valid tiling for this board.
  2. Consider the formula for a geometric sum. This is given in MCS problem 5.4 and also here on Wikipedia. Study

Tiling question from Induction (II) page in the notes MCS problems:

 5.2 (bad induction proof for tiling), 
 5.7 (bad induction proof for arithmetic sum)
 5.12 (distributive law of intersection over union)
 5.13 area of Koch snowflake
 5.17 formula construction, # true assignments
 5.19 proof of a formula
 5.23 many little parts, which things are true
 5.28 figure out what is true and prove it using induction, see also 5.32
 5.31 tricky strong induction proof

Demo proof to the lab: MCS problem 5.4