Numberof subsets of A = {1,2,3,,8,9} such that the maximum is in B = {1,3,5,7,9} The answer that you've gotten can't possibly be correct; after all, there are only 29 = 512 TOTAL subsets of {1,2,,9}. So, there's some definite over-counting happening here. Eachnumber in the series, and any combination of those numbers is a subset of 1,3,5,7,9. To be more clear, 1 is a subset, so are 3,5,7 or 9. 1&3 are also a subset, so are 5&7 and 7&9. all of the numbers less any one of the numbers is also a subset. so 1,3,5,& & are a subset. as is 3,5,7&9. get it? Explanation This is the sequence of the odd positive integers where the nth term (an) is: an = (2n −1) for n ∈ N Answer link T_n = 2n -1 This is clearly an arithmetic sequence because the terms differ by 2 each time. To find the nth term rule we need: a value for the first term , a and a value for the common difference d . Vay Nhanh Fast Money.

what is 1 3 5 7 9