I stumbled across an interesting formula involving the multichoose function. Let be natural numbers with , and suppose we want to find the sum of the reciprocals of the first multichoose coefficients. After experimenting a little, I found this surprisingly elegant formula:
Furthermore, if we add them to infinity, the formula simplifies to
So my question is: can you think of a nice combinatorial proof of this formula (without using induction)?
For those of you who don't know, denotes the number of different ways to pick a bunch of smarties with distinct choices of colour, where order is not important but repetition of colours is allowed.
It can also be defined this way:
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
r=1∑∞((mr))−1=m−1m
((mr))=(mr+m−1)
r=1∑∞(mr+m−1)1=(m+r−1)!(r−1)!×m!
=(r)(r+1).......(m+r−1)m!
(r)(m+r−1)1=m−11(r1−m+r−11)
(r)(r+1).......(m+r−1)m!=m−1m!(r(r+1)....(m+r−2)1−(r+1)....(m+r−1)1)
m−1m!×(m−1)!1=m−1m
Log in to reply
Yes, that's the algebraic proof using telescoping series, which is in essence a form of induction.
Is there any other way of interpreting this formula? For example, if we could write it as a taylor series expansion?
A combinatorial proof seems less likely to me, because there is no clear interpretation of ((mr)), though I might be wrong.
Log in to reply
Perhaps you're right that there's no good combinatorial proof. However the interpretation of ((mn)) is the number of different multisets of size m (where order is not important but repetition is allowed) which contain elements chosen from {1,2,3,...n}.
We can always convert the formula into one that only involves binomial coefficients: k=m∑n(mk)1=m−1m(1−(m−1n)1)
Hi guys I wish to improve my mathematics skill , so can anyone help me with it , how do I proceed with this idea ?
Log in to reply