A set of positive integers is defined recursively by the rule: 1 is a member of S, n is a member of S, then 2n-1 is a member of S. List all of the elements of S. I think that the answer is all positive odd integers. But I need to see the first several iterations expanded and work out in order to validate my answer.