307 views
0 votes
0 votes
Let P(n) be a statement and we prove P(k) ⇒ $P(k^{2})$ and  P(k) ⇒ P(k + 3). Then we to prove that P(n) is true for all n

 

(a) it is enough to prove the base case for k = 1

(b) it is enough to prove the base case for k = 1 and k = 2.

(c) it is enough to prove that base case for k = 1 and k = 2 and k = 3

(d) No base case can prove the statement.

Please log in or register to answer this question.

Related questions

2 votes
2 votes
1 answer
2
rsansiya111 asked Dec 3, 2021
336 views
The sum $\displaystyle{}\sum_{k=1}^{n}(1 + 2 + \dots + k)$ is a polynomial of what degree$1$$2$$3$$4$$5$
0 votes
0 votes
1 answer
3
rsansiya111 asked Dec 3, 2021
367 views
Given p, we want to prove q. Which of the following will suffice:(a) ¬q =⇒ ¬p(b) p ∧ q =⇒ q(c) ¬p ∧ ¬q =⇒ p(d) ¬q =⇒ q(e) p ∧ ¬q ∧ r =⇒ ¬r(f) non...