# Discrete Math Counting

How many permutations of the letters ABCDEFGH contain

a. the string ED?

b. the string CDE?

c. the strings BA and FGH?

d. the strings AB, DE and GH?

e. the strings CAB and BED?

f. the strings BCA and ABF?

How many ways are there for eight men and five women to stand in a line so that no two women stand next to each other? [Hint: First position the men and then consider possible positions for the women.]

A coin is flipped 10 times where each flip comes up either heads or tails. How many possible outcomes

a. are there in total?

b. contain exactly two heads?

c. contain at most three tails?

d. contain the same number of heads and tails?

How many positive integers between 50 and 100

a. are divisible by 7? Which integers are these?

b. are divisible by 11? Which integers are these?

https://brainmass.com/math/combinatorics/discrete-math-counting-505092

#### Solution Preview

Solution to Q1:

(a) To ensure that we can have the string "ED", we consider "ED" as a whole. So, we can permutate A, B, C, ED, F, G, H. Hence, there are 7!=5040 permutations of the letters ABCDEFGH that contain the string ED.

(b) To ensure that we can have the string "CDE", we consider "CDE" as a whole. So, we can permutate A, B, CDE, F, G, H. Hence, there are 6!=720 permutations of the letters ABCDEFGH that contain the string CDE.

(c) To ensure that we can have the strings "BA" and "FGH", we consider each of "BA" and "FGH" as a whole. So, we can permutate BA, C, D, E, FGH. Hence, there are 5!=120 permutations of the letters ABCDEFGH that contain the strings BA and FGH.

(d) Similar to part (c), we can permutate AB, C, DE, F, GH. Hence, there are 5!=120 permutations of the letters ABCDEFGH that contain the ...

#### Solution Summary

The discrete math counting is examined. How permutations of the letters ABCDEFGH contain are determined.