consider all length-13 strings of all uppercase letters. letters may be repeated.
(a) how many such strings are there?
(b) how many such strings contain the word charity?
(c) how many contain neither the word charity nor the word horses?
for a, i got 26^13, since there are 13 possible spaces for the string and each space has 26 choices. for part b i just got 26^6, since i treated charity as 1 block and then there was 6 other available spaces. for c, i did 26^13 - 26^6 - 26^7 since it wanted the amount without the two words. i wanted to check my thought process, since i am unsure if we need to multiply the answers by how many avaliable elements there are.

a. Your answer is correct, 26 choices for each of 13 positions, so total possible strings.

b. You have the right idea, but your method only counts one type of permutation, like

C H A R I T Y _ _ _ _ _ _

but doesn't account for other arrangements like

_ _ _ C H A R I T Y _ _ _

or

_ _ _ _ _ C H A R I T Y _

Treating CHARITY as one letter, we're then considering strings of length 7 (6 open slots plus this string), which we can arrange in 7! different ways. So the total number of such strings is .

c. This one is a bit more involved. I would go about it by counting the number of strings containing CHARITY but not HORSES, HORSES but not CHARITY, and both CHARITY and HORSES.

As we know from part (a), there are strings containing CHARITY, but the string HORSES can be found whenever there are 6 open slots to either side of CHARITY, i.e. in strings of either form

C H A R I T Y _ _ _ _ _ _

or

_ _ _ _ _ _ C H A R I T Y

Then there are 2 strings that we want to remove from the count, giving such strings.

Reasoning as we did in part (b) suggests that there are possible strings containing HORSES, and reasoning as we did in the previous case suggests only 2 of these contain CHARITY, giving a total of such strings.

There are 2 such strings,

C H A R I T Y H O R S E S

H O R S E S C H A R I T Y

Then by the inclusion-exclusion principle, the number of strings containing either CHARITY or HORSES is .

Finally, the number of strings containing neither CHARITY nor HORSES is complementary to the number of strings containing either of them, so the total is .

i suppose it should be (y=2x-5)

step-by-step explanation:

this is a good question! i’ll do some research and what i find, i’ll contact you asap when i have something! ✊