Suppose that P(n) is a propositional function. Determine for which positive integers n the statement P(n) must be true if: P(1) is true; for all positive integers n, if P(n) is true then P(n+2) is true.
(a) P(3)
(b) P(2)
(c) P(4)
(d) P(6)
This question was addressed to me in homework.
My question comes from Strong Induction and Well-Ordering topic in portion Induction and Recursion of Discrete Mathematics