MHB Solving Permutations Question with Restrictions

  • Thread starter Thread starter Lancelot1
  • Start date Start date
  • Tags Tags
    Permutations
Lancelot1
Messages
26
Reaction score
0
Hello all

Please look at this questions:

What is the number of permutations for creating a code of 3 digits from the digits 1,2,3,...,9 , such that every digit is equal or larger from the previous one ?

I know that if I wanted the number of permutations without restrictions it would be:

\[9^{3}\]

If all digits can be the same. Otherwise it would be

\[9\cdot 8\cdot 7\]

How do I approach the restriction, I mean, there are many possibilities, it depends on the numbers that I get.

Thank you.
 
Mathematics news on Phys.org
The number of ordered tuples $(a,b,c)$ where $1\le a\le b\le c\le 9$ is equal to the number of multisets $\{a,b,c\}$ because every multiset can be ordered in ascending order in a unique way.
 
Evgeny.Makarov said:
The number of ordered tuples $(a,b,c)$ where $1\le a\le b\le c\le 9$ is equal to the number of multisets $\{a,b,c\}$ because every multiset can be ordered in ascending order in a unique way.

Do you mean that the answer is :

\[\binom{11}{3}\] ?

I don't understand the rational behind it.
 
Lancelot said:
Do you mean that the answer is :

\[\binom{11}{3}\] ?
Yes. Because there is a bijection $f$ between the set of multisets of size 3 and the set of non-decreasing triples. Namely, $f(s)$ is $s$ sorted in increasing order.
 
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.

Similar threads

Replies
2
Views
2K
Replies
2
Views
3K
Replies
10
Views
2K
Replies
1
Views
2K
Replies
3
Views
3K
Replies
10
Views
2K
Replies
8
Views
7K
Replies
23
Views
2K
Back
Top