Use Mathematical Induction to Prove That $$2 \mid \left( n ^ { 2 } + 3 n \right) \text { for all } n \geq 1 \text {. }$$

Q10: give a recursive definition with initial

Q11: Use mathematical induction to prove that

Q12: give a recursive definition (with initial

Q13: Use mathematical induction to prove that

Q14: give a recursive definition (with initial

Q16: Find f(2) and f(3) if f(n) =

Q17: give a recursive definition with initial condition(s)

Q18: Prove that the distributive law

Q19: Verify that the program segment

Q20: Use mathematical induction to show that n