How Do Restrictions Affect Counting in Combinatorics?

  • Thread starter Thread starter n00neimp0rtnt
  • Start date Start date
  • Tags Tags
    Counting Disc
AI Thread Summary
The discussion focuses on solving combinatorial problems involving restrictions on letter and digit usage. For the first problem, the total number of strings of eight English letters without repetition is calculated using the factorial method, resulting in 26 * 25 * 24 * 23 * 22 * 21 * 20 * 19. The second problem, where 'X' is fixed as the first letter, reduces the available choices to seven letters. The third problem involves calculating all possible three-digit combinations and subtracting those with repeated digits. Understanding these restrictions is crucial for accurately determining the number of valid combinations.
n00neimp0rtnt
Messages
15
Reaction score
0

Homework Statement


1. How many strings of eight English letters are there if no letter can be repeated?
2. How many strings of eight English letters are there if X is the first letter and no letter can be repeated?
3. How many strings of three decimal digits do not contain the same digit three times?


The Attempt at a Solution


You're probably able to tell that all of these problems follow a similar pattern: restrictions on how often a letter/number can show up. Other problems on the same assignment ask WITHOUT restriction (How many strings of eight English letters are there if no letter can be repeated?) and can therefore be solved with an easy exponent (268), but I'm not sure how to do these ones. I do believe, however, they somehow involve a factorial, as I recall examples in class demonstrating use of them.

Possibly something like 26 * 25 * 24 * 23 * 22 * 21 * 20 * 19, since after you pick one of 26, there are only 25 left to choose, and after 25 there are only 24 left to choose, and so on.

Thanks in advance!
 
Physics news on Phys.org
n00neimp0rtnt said:

Homework Statement


1. How many strings of eight English letters are there if no letter can be repeated?
2. How many strings of eight English letters are there if X is the first letter and no letter can be repeated?
3. How many strings of three decimal digits do not contain the same digit three times?


The Attempt at a Solution


You're probably able to tell that all of these problems follow a similar pattern: restrictions on how often a letter/number can show up. Other problems on the same assignment ask WITHOUT restriction (How many strings of eight English letters are there if no letter can be repeated?) and can therefore be solved with an easy exponent (268), but I'm not sure how to do these ones. I do believe, however, they somehow involve a factorial, as I recall examples in class demonstrating use of them.

Possibly something like 26 * 25 * 24 * 23 * 22 * 21 * 20 * 19, since after you pick one of 26, there are only 25 left to choose, and after 25 there are only 24 left to choose, and so on.

Thanks in advance!
Yes, that's right for #1, assuming that all the letters are the same case, either upper case or lower case.

For #2, your thinking should be similar, but now you have only 7 letters that can vary.

For #3, it's probably easier to consider all of the possible 3-digit combinations, minus the combinations that use the same digit three times.
 
Back
Top