Intereting Posts

Expectation of Double Dice Throw
Show that if $x,x^{'}\in C$ then $C_x=C_{x^{'}}$.
Explanation on arg min
Proof of injective and continuous
Prove $\mathbb{P}(\sup_{t \geq 0} M_t > x \mid \mathcal{F}_0)= 1 \wedge \frac{M_0}{x}$ for a martingale $(M_t)_{t \geq 0}$
Inverse of a bijection f is equal to its derivative
Find the value of $\frac{1}{d_1}+\frac{1}{d_2}+\dots+\frac{1}{d_k}$.
Why does $\mathbb{R}$ have the same cardinality as $\mathcal{P}(\mathbb{N})$?
Euclidean domain in which the quotient and remainder are always unique
How many ways are there for 8 men and 5 women to stand in a line so that no two women stand next to each other?
Please prove: $ \lim_{n\to \infty}\sqrt{\frac{1}{n!}} = 0 $
The unique loop $L$ (quasigroup with unit) of order $5$ satisfying $x^2 = 1$ for all $x \in L$
Does a process with continuous sample path always has continuous variance
Applications of Principal Bundle Construction: Vague Question
How to find the smallest number with just $0$ and $1$ which is divided by a given number?

I have a data set $2\; 3\; 3\; 4\; 4\; 4\; 4$

I want to find the number of unique numbers of $3$ digit numbers that can be formed using this.

I was thinking of doing $\large{\frac{^7P_3}{4!\times 2!}}$, but this doesn’t seem right.

- Largest set of perpendicular vectors
- Summing the binomial pmf over $n$
- proving an invloved combinatorial identity
- How to prove $\sum\limits_{k=0}^n{n \choose k}(k-1)^k(n-k+1)^{n-k-1}= n^n$?
- What are the analogues of Littlewood-Richardson coefficients for monomial symmetric polynomials?
- Expressing a positive integer as a sum of positive integers

- A three variable binomial coefficient identity
- Probability of two people meeting in a given square grid.
- Finding the number of solutions to an equation?
- How many triangles with integral side lengths are possible, provided their perimeter is $36$ units?
- Why is $S_5$ generated by any combination of a transposition and a 5-cycle?
- Combinatorics problem on $20$ people, $12$ months, and distinguishable groups
- Combinatorial proof of $\sum^{n}_{i=1}\binom{n}{i}i=n2^{n-1}$.
- How can i find closed-form expression of generating function of this series?
- Count ways to take pots
- Combinatorial interpretation of Binomial Inversion

If you have `2`

as the first digit, you can have `3`

and `4`

as the second and third digits, so this gives `233 234 243 244`

, **four** numbers.

If you have `3`

as the first digit, you can have `2`

and `3`

and `4`

as second and third digits (but `2`

only once), giving `323 332 324 342 334 343 344`

, **seven** numbers.

If you have `4`

as the first digit, you can have `2`

, `3`

and `4`

as second and third digits, giving `424 442 423 432 433 434 443 444`

, **eight** numbers.

4 + 7 + 8 = 19 unique 3 digit numbers.

Rather brute force, but it works pretty easily for this problem.

Alternatively, start from all 3-digit permutations of {2,3,4}, with repeats. That’s $3^3=27$. Then remove numbers that have too many 2’s or 3’s.

Take out numbers with exactly 2 2’s: 2 choices for the remaining digit and 3 ways to permute the 3 digits is 6.

Take out numbers with exactly 3 2’s, of which there’s only 1.

Take out numbers with 3 3’s, of which there’s only 1.

Then what’s left is 27-6-1-1 = 19

If you start off with the 7P3 ways of choosing three distinct ordered elements from the multiset {2,3,3,4,4,4,4} then you will need to compensate for the multiply-counted 3-digit numbers in different ways depending on the structure of the number itself. Consequently, you’re likely to be stuck using an almost brute-force attack on the problem.

For example, you could generate all the unordered 3-digit numbers:

```
233, 234, 244, 334, 344, 444
```

Then consider one-by-one how many ordered 3-digit numbers have those particular digits.

```
3!/2! + 3! + 3!/2! + 3!/2! + 3!/2! + 3!/3!
```

Once you’re done, you could check your result using GAP by:

```
Arrangements([2,3,3,4,4,4,4],3);
```

It seems to me that a general formula for this simple but irregular question would be an overkill. Perhaps it is more efficient to simply count the possibilities:

- for each of the possible 3 locations of 2 there are 4 such numbers, for a total of 12;
- there are a total of 8 different 3-digit numbers which have digits 3 or 4; however exactly one of them, namely 333, is not permissible; thus there are 7 different allowable 3-digit numbers, which have 3 and 4 as their only digits;

We see that all together there are 12+7 = 19 different solutions (3-digit numbers, which satisfy the stated assumptions).

- What is the distribution of $Y = e^X$ when $X$ is normal?
- proof of that a continuous function has a fixed point
- Period of repeating decimals
- Direct formula for area of a triangle formed by three lines, given their equations in the cartesian plane.
- Infinite Prime Numbers: With Fermat Numbers
- Variance of the sums of all combinations of a set of numbers
- Conjugacy classes of a compact matrix group
- Fallacy on using interpretation instead of definition in computing conditional probability? (using multiplication law circularly?)
- Generously Feasible?
- Measure zero of the graph of a continuous function
- Show that the area of a triangle is given by this determinant
- zero of vector field with index 0
- Conditions for augmenting a collection of sets so that the new sets are small but the hull is large?
- A special cofinal family in $(\omega^\omega,\le)$
- Can the following triple integral be computed via elementary calculus methods?