Give the answer of the following questions: What is principle of mathematical induction? Explain types of it. Also what is need of those PM’s'? What do you understand by strong principle of mathematical induction? How it is different from mathematical induction? Give an example of a statement where you require strong principle of mathematical induction. Prove the following using weak pmi: Prove that integer bigger than 2 have prime factorization. Define: The principle of mathematical induction. Also prove for any string x and n>=0 REV (xy) =REV(y) REV(x). Strong PMI: Suppose p(n) is a statement involving an integer n, then to prove that p(n) is true for every n>= n 0 it is sufficient to show two thing. P(n 0 ) is true For any k>=n 0 , if p (n) is true, for every n satisfying n 0 <=n<=k then p (k+1) is true. Prove the following using strong pmi: For any n>=2, n is either prime or product...
Comments
Post a Comment