Combinatorial question: permutation, binomial coefficient

Click For Summary

Discussion Overview

The discussion revolves around a combinatorial problem involving the calculation of the number of 6-digit numbers containing exactly two instances of the digit 1, two instances of the digit 2, and two other digits chosen from the range 3 to 9, without including the digit 0. Participants are analyzing different approaches to arrive at the solution and the reasoning behind the provided formula.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested
  • Mathematical reasoning

Main Points Raised

  • One participant presents a formula from a book: \(\frac{6!}{2!2!}*\binom{7}{2} + \frac{6!}{2!2!2!}*7\) and seeks clarification on its derivation.
  • Another participant proposes an alternative method using \(\binom{6}{2}\) for placing the "1"s and \(\binom{4}{2}\) for placing the "2"s, leading to a total of \(\frac{6!}{2! 2! 2!}\) and suggests that the remaining digits have 7 options each.
  • A third participant suggests that the first term of the original formula accounts for cases where the two remaining digits are different, while the second term accounts for cases where one of the digits is repeated.
  • Another participant mentions the use of the product rule and suggests that the original formula may be derived from permutations with repetition, indicating a breakdown of the problem into two cases.

Areas of Agreement / Disagreement

Participants express differing views on the validity and reasoning behind the original formula and the alternative approaches. There is no consensus on which method is preferable or whether the original solution is correct.

Contextual Notes

Participants highlight various interpretations of the problem and the calculations involved, but there are unresolved assumptions regarding the treatment of the remaining digits and the reasoning behind separating cases in the original formula.

blob84
Messages
25
Reaction score
0
How many numbers of 6 digits which have exatctly the digit 1 (2 times), digit 2 (2 times), without zero, are there?
The book post this solution: \frac{6!}{2!2!}*\binom{7}{2} + \frac{6!}{2!2!2!}*7= 4410,
but I'm trying to find an explanation for this result.
 
Physics news on Phys.org
That is a weird way to calculate the number.

Here is what I would do:

There are ##6 \choose 2## ways to place the "1"s, and ##4 \choose 2## ways to place the "2"s afterwards. If you write both with factorials, a 4! cancels and you get ##\frac{6!}{2! 2! 2!}##. The remaining two digits have 7 options each (3...9), therefore the total number of digits is...

Of course, you can split 7*7 in ##2 {7\choose 2} + 7##, but where is the point? The first part corresponds to the number of numbers where the two remaining digits are different, but I don't see a reason to consider them separately.
 
It is \binom{6}{2}*\binom{4}{2}*7^2 by the general form of the product rule, where there are for any pairs of digits 3 cases, if I'm not wrong, thank you.
I suppose to get this weird formula it calculate permutation with repetition and it brokes the problem in two sets.
 
The 1st term corresponds to the case when the other two digits are different and the 2nd term corresponds to the case when another digit is repeated (three double digits).
 

Similar threads

  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
Replies
1
Views
1K
  • · Replies 3 ·
Replies
3
Views
785
Replies
1
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
Replies
3
Views
3K