MHB John's Cupcake Challenge: Finding the Perfect Distribution

Monoxdifly
MHB
Messages
288
Reaction score
0
John has baked 31 cupcakes for 5 different students. He wants to give them all to his students but he wants to give an odd number of cupcakes to each one. How many ways can he do this?

Brute-forcing will take about a whole day, I think. If 4 students receive 1 cupcake and the other one receive 27, that's already 4 combinations. If there are 3 1's, the other two might be 3 and 25, 5, and 23, 7 and 21, etc. Is there more efficient way?
 
Mathematics news on Phys.org
Hey Mr. Fly,

It's a variation of the stars and bars problem.
See the linked article how it works.

In this particular case we can add 5 cakes first for a total of 36.
Next we divide them in 18 stacks of 2 cakes each.
If we put 4 dividers (bars) in between them, we get 5 portions. We give them to each of the 5 students.
Oh, and before we do so, we take away 1 cake from each portion, so that each student gets an odd number.

How many ways to divide 4 bars over the 17 spaces between the stacks?
 
klaas van aarsen said:
how many ways to divide 4 bars over the 17 spaces between the stacks?

17c4?
 
Monoxdifly said:
17c4?

Yep. (Nod)
 
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
15
Views
6K
Replies
9
Views
4K
Replies
125
Views
19K
2
Replies
93
Views
14K
2
Replies
60
Views
11K
Back
Top