Permutation with exception/repetition

AI Thread Summary
To calculate permutations with repetition from a multiset, the formula is based on the total number of elements and the frequency of each unique element. For a set of n elements where some elements repeat, the formula is n! / (n1! * n2! * ... * nk!), where n is the total number of elements, and n1, n2, ..., nk are the frequencies of the distinct elements. In the case of creating a 3-digit number from the set {1, 1, 1, 2, 3}, the calculation involves selecting 3 elements from these 5 while considering the repetitions. This approach can be complex, but it allows for the determination of unique permutations based on the chosen elements. Understanding this formula is essential for accurately calculating the number of variations possible.
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...
Thread 'Imaginary Pythagorus'
I posted this in the Lame Math thread, but it's got me thinking. Is there any validity to this? Or is it really just a mathematical trick? Naively, I see that i2 + plus 12 does equal zero2. But does this have a meaning? I know one can treat the imaginary number line as just another axis like the reals, but does that mean this does represent a triangle in the complex plane with a hypotenuse of length zero? Ibix offered a rendering of the diagram using what I assume is matrix* notation...
Back
Top