MHB With how many ways can the digits be arranged?

  • Thread starter Thread starter evinda
  • Start date Start date
Click For Summary
The discussion focuses on the arrangement of the digits 1, 2, 3, 4, 5, which can be arranged in 5! ways. For the digits 1, 1, 3, 4, 5, the correct formula for arrangements is derived as 5! divided by 2!, accounting for the repetition of the digit 1. Participants clarify that the total arrangements should be calculated as 5! / 2! due to the indistinguishable 1s. The conversation also touches on similar examples with more digits, reinforcing the use of factorials to account for repetitions. Overall, the key takeaway is the correct application of permutations with repeated elements.
evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hey! (Blush)

With how many ways can the digits $1,2,3,4,5$ be arranged?And with how many ways can these digits $1,1,3,4,5$ be arranged?

The digits $1,2,3,4,5$ can be arranged with $5!$ ways,right?

For the second subquestion,I tried to arrange the digits: $1,1,3$ and found that there are $\binom{3}{2}=3$ ways,so is it in our case $\binom{5}{2}$,or am I wrong?? :confused:
 
Physics news on Phys.org
I thought about it again.. (Thinking) Is it maybe $\frac{5!}{2!}$ ? :confused: Because,we choose firstly $2$ positions for the $1$s.There are $\binom{5}{2}$ possibilities,and then we arrange the left digits at the $3$ left positions.As the digits are discrete,there are $3!$ ways to arrange them.So,there are,in total, $\binom{5}{2} \cdot 3!$ ways to arrange the digits.
 
Last edited:
evinda said:
I thought about it again.. (Thinking) Is it maybe $\frac{5!}{2!}$ ? :confused: Because,we choose firstly $2$ positions for the $1$s.There are $\binom{5}{2}$ possibilities,and then we arrange the left digits at the $3$ left positions.As the digits are discrete,there are $3!$ ways to arrange them.So,there are,in total, $\binom{5}{2} \cdot 3!$ ways to arrange the digits.

First pretend all possibilities are distinct: so that would $5!$ possibilities. But for each arragnement, 2 are not distinct. So there are $\frac{5!}{2}$ possible arrangements.
 
Fermat said:
First pretend all possibilities are distinct: so that would $5!$ possibilities. But for each arragnement, 2 are not distinct. So there are $\frac{5!}{2}$ possible arrangements.

So you mean that the denominator should't be $2!$ ? For example,if we would have to arrange the digits $1,1,1,2,2,3,4,5$ wouldn't there be $\frac{8!}{3!2!}$ ways? :confused:
 
Last edited:
evinda said:
So you mean that the denominator should't be $2!$ ? For eaxmple,if we would have to arrange the digits $1,1,1,2,2,3,4,5$ wouldn't there be $\frac{8!}{3!2!}$ ways? :confused:

you are right,but observe 2!=2
 
Last edited:
Fermat said:
you are right,but observe 2!=2

Ok,thank you! :)
 
There is a nice little variation of the problem. The host says, after you have chosen the door, that you can change your guess, but to sweeten the deal, he says you can choose the two other doors, if you wish. This proposition is a no brainer, however before you are quick enough to accept it, the host opens one of the two doors and it is empty. In this version you really want to change your pick, but at the same time ask yourself is the host impartial and does that change anything. The host...

Similar threads

  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 18 ·
Replies
18
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 20 ·
Replies
20
Views
2K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 19 ·
Replies
19
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K