Question: 1. If the statement you want to prove is made in terms of n, should your inductive step be done using n or using k (or some other variable)?
2. Prove by induction that the path graph Pn has n-1 edges.
3. Write 2!+4!+6!+8!+10! in summation notation. (Knowing what 2!,4!,6!, etc. means is not necessary for completing this problem.)