Conjecture a formula for E=1(-1)*k², and then prove the formula is correct using induction.

H 10. The problem that was used to introduce ordinary mathe- matical induction in Section 5.2 can also be solved using strong mathematical induction. Let P(n) be “any collec- tion of n coins can be obtained using a combination of 3¢ and 5¢ coins." Use strong mathematical induction to prove that P(n) is true for all integers n > 14.

Solve using strong induction.

what is induction?

Discrete math. Show step by step how to solve this induction question. Every step must be shown. Please type this answer.

Discrete Mathematic: Prove by Induction

use this format state P(n) basis step: P(0) is true base case inductive step: if P(K) is true, then P(K+1) is true inductive hypothesis