You can prove a statement p(n) for all natural numbers n by showing p(1), p(2) and p(n)? p(n+1) for all natural numbers n.

a. in an inductive proof, you always obtain the statement p(n+1) by adding n to both sides of p(n).
b. in a structural induction proof, to show that a statement holds for all elements of a recursively defined set, you must show it for all members of the initial population, and that it is passed on through the recurrence relations that create new elements from old elements.
c. induction is a special case of structural induction.
d. in a structural induction proof, to show that a statement p(n) holds for all elements n of a recursively defined set, you must show p(n) for all n in the initial population, and that whenever p(n) is true for some n, p(n+1) is also true.
e. if p(n) is a statement that is false for some, or even all, natural numbers n , it is still possible that p(n)? p(n+1) holds for all natural numbers n.
f. the fibonacci sequence fn is big-omega of (3/2)n.
g. you can prove a statement p(n) for all natural numbers n by showing p(1) and p(n)? p(n+1) for all natural numbers n.
h. the rules that create new from old elements in a recursively defined set never create the same element twice.
i. you prove a statement p(n) by induction for all natural numbers n by showing p(1) and by showing that if p(k) is true for all natural numbers k, then p(k+1) must also be true.