2. Using the explicit function write the first five terms in the sequence! (5 pts) f(n) = 1000(1/2)^n-1
1 answer:
You might be interested in
This is a problem of Permutations. We have 3 cases depending on the number of B's. Since no more than three B's can be used we can use either one, two or three B's at a time.
Case 1: Five A's and One B
Total number of letters = 6
Total number of words possible =
Case 2: Five A's and Two B's
Total number of letters = 7
Total number of words possible =
Case 3: Five A's and Three B's
Total number of letters = 8
Total number of words possible =
Total number of possible words will be the sum of all three cases.
Therefore, the total number of words that can be written using exactly five A's and no more than three B's (and no other letters) are 6 + 21 + 56 = 83