AlgebraDifficulty 7.9National olympiad, round 2Find the answer
Given positive integers k,m,n such that 1≤k≤m≤n. Evaluate
i=0∑nn+k+i(−1)i⋅i!(n−i)!(m+i)!(m+n+i)!.
A number or a short expression. Spacing and $ signs are ignored.
Solution
Given positive integers k,m,n such that 1≤k≤m≤n, we aim to evaluate the sum i=0∑nn+k+i(−1)i⋅i!(n−i)!(m+i)!(m+n+i)!.
To solve this, we employ a calculus-based approach. We start by expressing the sum in terms of an integral: i=0∑nn+k+i(−1)i⋅i!(n−i)!(m+i)!(m+n+i)!=i=0∑ni!(n−i)!(m+i)!(−1)i(m+n+i)!∫01xn+k+i−1dx.
This can be rewritten as: ∫01[i=0∑n(in)(nm+n+i)(−1)ixi]xn+k−1dx.
Next, we use the binomial theorem and properties of partial derivatives: ∫01[i=0∑n(in)(−1)ixi⋅n!1∂yn∂nym+n+iy=1]xn+k−1dx.
This simplifies to: n!1∂yn∂n[∫01i=0∑n(in)(−1)ixn+k+i−1ym+n+idx]y=1.
Further simplification gives: n!1∂yn∂n[∫01xn+k−1ym+n(1−xy)ndx]y=1.
We continue by integrating and differentiating: n!1∂yn∂n[ym−k∫0yun+k−1(1−u)ndu]y=1.
Using the Fundamental Theorem of Calculus, we evaluate: n!1j=0∑n(jn)[∂yj∂jym−k]y=1[∂yn−j∂n−j∫0yun+k−1(1−u)ndu]y=1.
For j<n, the second factor is zero because we differentiate at most n−1 times, and there is a zero of order n at y=1. For j=n, the first factor is zero because m−k<m≤n. Thus, all terms of the sum vanish.
Therefore, the value of the sum is: i=0∑nn+k+i(−1)i⋅i!(n−i)!(m+i)!(m+n+i)!=0. The answer is: \boxed{0}.
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.
Source: Omni-MATH,
licensed Apache-2.0.
Statement and solution reproduced as published; topic and difficulty added by this site.