CP 7 Mathematical Induction 2

Question 1

what is the opposite of a prime number

Answer 1

a composite number

Question 2

what is the principle of Strong mathematical induction

Answer 2

all statements up to P(k) are true including P(k)
-assume we know P(0) is true
- for each k≥0, if P(0), P(1),…P(k) are all true then P(k+1) is true as well

Question 3

TF in strong mathematical induction the base case doesnt have to be 0

Answer 3

T, it can be the lowest number given in the statement we just have to plug it in and find if its true

Question 4

TF sometimes we can use strong mathematical induction as a safety to just assume everything

Answer 4

T