Hello so I just need some help determining wether my logic is correct or if it's flawed.
Bob starts with a string Superman and then applies one modification to it where a modification consists of inserting a number at some position. This process can produce a string like Super5man.
1. How many different strings can Bob create starting with Superman?
So 10 choices and 9 positions: 10 x 90 = 90
Suppose Bob wants to apply two modifications to produce a string like 9Super5man or a string like Super95man.
We want to determine the different strings Bob can create. He does this in two steps:
Step 1. Choose the first number (say 5) and insert it in Superman. (It produces Super5man, etc.)
Step 2. Choose the second number (say 9) and insert it in the string obtained after Step 1. (If the string from step 1 was Super5man, then the result can be 9Super5man or Super95man, etc.)
2. To determine the number of different strings Bob can create, we can just apply the Product Rule. Explain why the product 1 rule will result in overcounting. In particular, what strings will be counted more than once?
So here i'm at a bit of a loss. I'm not too sure what consist of overcounting here.
Would this be considered over counting
3. How would you solve the problem? Explain why you think it is correct.
_ _ s _ _ u _ _ p_ _ e_ _ r_ _ m_ a _ n_ _
20 --> total number of positions
10 ----> total number of digit options
So: (20 x 10) (first option) + (20 x 10) (second option)