Strong Induction Continued
Exercise 13, page 195
Proposition: Prove that \(6|(n^3-n)\) for all \(n\ge 1\).
Trees (text, pages 189-190)
Proposition: A tree with \(n\) vertices has \(n-1\) edges.
Proposition: Prove that \(6|(n^3-n)\) for all \(n\ge 1\).
Proposition: A tree with \(n\) vertices has \(n-1\) edges.