Recitation Mathematical Induction

if the base case (for n = 1) is true and inductive step is true, then the theorem holds for all positive integers

if the base case (for n = 1) is true and inductive step is false, then the theorem holds for all positive integers

if the base case (for n = 1) is false and inductive step is true, then the theorem holds for all positive integers

if the base case (for n = 1) is false and inductive step is false, then the theorem holds for all positive integers

45

50

54

55

3

2

0

1

2

3

The process of proving that P(k+1) is true

The assumption that if P(k+1) is true, then the statement is true

The assumption that k is an integer

The assumption that the original statement is True

0

1

96

97

0

1

3

Prove that the base case is true

Prove that k is in the same domain as n

Prove that, assuming k is true, k+1 is true

Prove that the process of induction is beyond our understanding and that only the math gods can help us now

7

14

1

0

Three dominoes

Dominoes with three blocks instead of two

vegan Domino's pizza

Triangular dominoes

A fancy cheese