Number of Combinations Created from Restricting a Set
Here’s my question:
I have a set that looks like this:
S = {u, v , w , x , y , z}
And it has this restriction:
1 =< u < v < w < x < y < z <= 11
Essentially, of 6 values, all of them must be greater than or equal to 1, must be less than their successor, must be greater than their predecessor, and must be less than or equal to 11.
How many sets produced from this restriction?
Thank you in advance.
Answer
Answers can only be viewed under the following conditions:
- The questioner was satisfied with and accepted the answer, or
- The answer was evaluated as being 100% correct by the judge.
![Erdos](https://matchmaticians.com/storage/user/100028/thumb/matchmaticians-3empnt-file-5-avatar-512.jpg)
4.7K
-
Great answer and really intuitive. If you were interested, this is actually a question in disguise that is analyzing the number of scales that can be formed with 7 notes. Thank you so much :)
-
Interesting! I am glad I was able to help.
The answer is accepted.
Join Matchmaticians Affiliate Marketing
Program to earn up to a 50% commission on every question that your affiliated users ask or answer.
- answered
- 527 views
- $2.00
Related Questions
- Prove a set is well-ordered
- Set theory question
- Set theory question
- Recursive Set
- What is the asymptotic density of $A$ and $B$ which partition the reals into subsets of positive measure?
- Set problem. Need it well written...
- Discrete Math/ Set theory Question
- Find a system consisting of two sets, neither of which is a subset of the other