Question: Use the principal of Mathematical Induction to prove 2|(n2+n) for all n>=0
Follow Math Help Forum on Facebook and Google+
Originally Posted by oldguy Question: Use the principal of Mathematical Induction to prove 2|(n2+n) for all n>=0 for n=0, suppose it is true that for n=k, . show that if n=k+1, then . now, .. notice that, and therefore, or . QED
Hello, oldguy! Use Mathematical Induction to prove: . for all is a multiple of 2. Verify . . . True! Assume for some integer Add to both sides: . We have: . . . . . . . . .. Therefore, we have proved . . The inductive proof is complete.
Thanks for the help.
View Tag Cloud