Consider the following recursive definition of a set S: 2,3, and 4 are members of S, so is 6 added to any member of S. Consider
the n'th finite approximation of the recursive definition of S. Prove using the first mathematical induction that, for all n >
1 answer:
You might be interested in
