How many 5-digit briefcase combinations contain

  • Thread starter Thread starter cronuscronus
  • Start date Start date
  • Tags Tags
    Combinations
cronuscronus
Messages
40
Reaction score
0
Hi all. I wanted to double check some of my work, and get some feedback if there's any errors. Any help is appreciated!

a) A particular digit (say 5, for example).
Essentially we're choosing one digit. 10C1 is 10, and we have 5 slots, so the answer here is 10^5 = 100,000 combinations.

b) A pair and three other distinct digits. (e.g 27421)
Here we are really just choosing 4 distinct digits. So we calculate the combinations without replacement. 10*9*8*7 = 5,040 combinations.

c) Two pairs of distinct digits and 1 other distinct digit. (e.g
12215)
Here we are choosing 3 distinct digits. So we calculate the combinations without replacement. 10*9*8 = 720 combinations.

d) A palindrome of length 5 (e.g. 12321 , or 11111 or 12221)
The first digit can be selected from 1-9. The next digit can be selected from 0-9. The next digit can also be selected from 0-9. The last two digits are determined.

So we can calculate 9*10^2 = 900 5-digit palindromes.

Thanks for the help!
 
Physics news on Phys.org
cronuscronus said:
Hi all. I wanted to double check some of my work, and get some feedback if there's any errors. Any help is appreciated!

a) A particular digit (say 5, for example).
Essentially we're choosing one digit. 10C1 is 10, and we have 5 slots, so the answer here is 10^5 = 100,000 combinations.
Does that make sense? All told, there are 100,000 different 5-digit numbers, with no requirements that any of them be any particular number.
cronuscronus said:
b) A pair and three other distinct digits. (e.g 27421)
Here we are really just choosing 4 distinct digits. So we calculate the combinations without replacement. 10*9*8*7 = 5,040 combinations.

c) Two pairs of distinct digits and 1 other distinct digit. (e.g
12215)
Here we are choosing 3 distinct digits. So we calculate the combinations without replacement. 10*9*8 = 720 combinations.

d) A palindrome of length 5 (e.g. 12321 , or 11111 or 12221)
The first digit can be selected from 1-9. The next digit can be selected from 0-9. The next digit can also be selected from 0-9. The last two digits are determined.

So we can calculate 9*10^2 = 900 5-digit palindromes.

Thanks for the help!
 
Hi Mark. It makes sense in my head because if it can be any particular digit, then it can be any digit. Is this incorrect?
 
Yes, I believe that is incorrect. "Any particular digit" doesn't mean "any old digit at random." For example, if you're looking for all the numbers with, say, a 5 in the most significant digit, there are 104 different possiblilites.
 
  • Like
Likes 1 person
Hi Mark. I think that makes sense. We essentially remove it from the number of digits since it was already chosen? The other 4 slots are just the combinations of the chosen digit?
 
How do the rest look to you? I think I'm getting it :).
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top