Let's take Keno for example:
From number 1 to 80, there are (2080)=3,535,316,142,212,174,320 ways the casino can draw 20 numbers out of 80.
Given that the sum of the 20 numbers drawn is n, how many combinations satisfy the following conditions:
- x1+x2…+x20=n
- x1,x2,…,x20 are distinct
- 1≤xi≤80
Eg. If n=210, which is the minimum sum, 1+2+3+4+5+6+7+8+9+10+11+12+13+14+15+16+17+18+19+20=210, therefore there is only one possible combination for the sum of 20 numbers to be 210.
What about, say, n=896? I have tried stars and bars but not really sure how to apply the distinct restriction.
#Combinatorics
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There are no comments in this discussion.