Permutation with exception/repetition

Crazorin
Messages
4
Reaction score
0
I need a formula to calculate permutation.
For example I have a 5 numbers and I creating a 3 digit number from it.
The numbers are: 1, 1, 1, 2, 3; I could write up 13 variations, but I couldn't work out the formula.
If the numbers are: 1, 1, 2, 2, 3 the number of variations are 18 (if I wrote them up properly)
Is there a formula to calculate this, or is it becoming too complex?
 
Mathematics news on Phys.org
Crazorin said:
I need a formula to calculate permutation.
For example I have a 5 numbers and I creating a 3 digit number from it.
The numbers are: 1, 1, 1, 2, 3; I could write up 13 variations, but I couldn't work out the formula.
If the numbers are: 1, 1, 2, 2, 3 the number of variations are 18 (if I wrote them up properly)
Is there a formula to calculate this, or is it becoming too complex?

You're looking for permutations of a multiset (a set in which redundant elements are allowed).
(See https://en.wikipedia.org/wiki/Permutation#Permutations_of_multisets.)
 
aikismos said:
You're looking for permutations of a multiset (a set in which redundant elements are allowed).
(See https://en.wikipedia.org/wiki/Permutation#Permutations_of_multisets.)

Thanks. It is almost what I need except in those example they use up all element of each set.
I would only use part of it. So if the sets are {1, 1}{2, 2}{3} then I have a total of 5 elements. And the question is how many different 3 digit numbers I can create of these 5 elements. Because they are numbers, the order matter so it would be a kind of permutation.
What would be the formula for that?
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top