Define a set S recursively as follows: I. BASE: 1 S, 3 S, 5 S, 7 S, 9 S II. RECURSION
Chapter 5, Problem 9(choose chapter or problem)
Define a set S recursively as follows: I. BASE: 1 S, 3 S, 5 S, 7 S, 9 S II. RECURSION: If s S and t S then a. st S b. 2s S c. 4s S d. 6s S e. 8s S III. RESTRICTION: Nothing is in S other than objects defined in I and II above. Use structural induction to prove that every string in S represents an odd integer.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer