This is a discrete math question:

1) use mathematical induction (weak form) to prove that n! 1.

I have included a pic to show how the format of this proof should follow.

Thank you

Step 1: Formulate your problem as a predicate of natural numbers. Let P(n) be a proposition such that Step 2: Base case. (Prove your base case here.) Step 3: Inductive step Step 3a: Mention this statement We need to prove that P(k)> P[k+1) [For weak form] We need to prove that (Vi isk P(k)) ->P(k+1) [For strong form] Step 3b: Formulate what P(k) means with respect to this specific problem: We assume P(k) to be true, which means let P(k) be a proposition such that...... For weak form] We assume (Vi isk P(k) -> P(k+1) to be true, which means let P(k) be a proposition such that Step 3c: Formulate what P(k+1) amounts to, in this problem: Let P(k+1) be a proposition such that.. Step 3d: Provide the proof of P(k+1) being true here. (EXAMPLES WILL NOT WORK HERE, NEED TO PROVIDE ACTUAL PROOF) Step 3e: Vn 2 1 P(n) (n 2 1 varies depending on your base case) QED