Suppose S(n) is a predicate on natural numbers (Positive Integers), n and suppose
\\ This says that If S(k) is true then S(k+2) is also true.
Now, if above assertion holds then Consider the following statements:

S1 is NEVER true. S1 becomeing true means S(n) is true for all n <= 100 and S(n) is false for all n > 100. But this is impossible because If S(99) is true then S(101) will have to be true. So, S1 never holds.

S2 is always true. If S(1) is true then S(3), S(5), S(7)... etc will be true so if S(1) is true then S(m) is true for all odd m.
So, S2 always holds.