Binomial Coefficient Challenge 9!

Find a closed form of

k=0n1(km)Hk\displaystyle \sum_{k=0}^{n-1}{\binom{k}{m} H_k}

where HkH_k is the kkth Harmonic number.

Note by Kartik Sharma
3 years, 12 months ago

No vote yet
1 vote

  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:

  • Use the emojis to react to an explanation, whether you're congratulating a job well done , or just really confused .
  • Ask specific questions about the challenge or the steps in somebody's explanation. Well-posed questions can add a lot to the discussion, but posting "I don't understand!" doesn't help anyone.
  • Try to contribute something new to the discussion, whether it is an extension, generalization or other idea related to the challenge.
  • Stay on topic — we're all here to learn more about math and science, not to hear about your favorite get-rich-quick scheme or current world events.

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold

- bulleted
- list

  • bulleted
  • list

1. numbered
2. list

  1. numbered
  2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1

paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
    # 4 spaces, and now they show
    # up as a code block.

    print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in \( ... \) or \[ ... \] to ensure proper formatting.
2 \times 3 2×3 2 \times 3
2^{34} 234 2^{34}
a_{i-1} ai1 a_{i-1}
\frac{2}{3} 23 \frac{2}{3}
\sqrt{2} 2 \sqrt{2}
\sum_{i=1}^3 i=13 \sum_{i=1}^3
\sin \theta sinθ \sin \theta
\boxed{123} 123 \boxed{123}

Comments

k=0n(km)Hk=k=1n(km)Hk \sum_{k=0}^{n} \dbinom{k}{m} H_{k} = \sum_{k=1}^{n} \dbinom{k}{m} H_{k}

=k=1nr=1k1r(km) = \sum_{k=1}^{n} \sum_{r=1}^{k} \dfrac{1}{r} \dbinom{k}{m}

=r=1nk=rn1r(km) = \sum_{r=1}^{n} \sum_{k=r}^{n} \dfrac{1}{r} \dbinom{k}{m}

=r=1n1r((n+1m+1)(rm+1)) = \sum_{r=1}^{n} \dfrac{1}{r} \left(\dbinom{n+1}{m+1} - \dbinom{r}{m+1}\right)

=(n+1m+1)Hn1m+1r=1n(r1m) = \dbinom{n+1}{m+1} H_{n} - \dfrac{1}{m+1} \sum_{r=1}^{n}\dbinom{r-1}{m}

=(n+1m+1)Hn1m+1(nm+1) = \dbinom{n+1}{m+1} H_{n} - \dfrac{1}{m+1} \dbinom{n}{m+1}

k=0n(km)Hk=(n+1m+1)(Hn+11m+1)  \therefore \sum_{k=0}^{n} \dbinom{k}{m} H_{k} = \dbinom{n+1}{m+1}\left(H_{n+1} - \frac{1}{m+1}\right) \ \square

Alternatively, we can form a recurence in nn or mm and solve for the closed form. Yet another approach can be to consider the identity r=0k1(rm1)=(km) \sum_{r=0}^{k-1} \dbinom{r}{m-1} = \dbinom{k}{m} and substitute in the sum.

Note that this result also holds for values of mm other than positive integers.

Ishan Singh - 3 years, 12 months ago

Log in to reply

There is a typo. It should be (nm+1)\binom{n}{m+1} rather than (n+1m+1)\binom{n+1}{m+1}. The sum is till n1n-1.

Easiest of the lot, I guess. Yet another method is to use summation by parts. It was intended for that.

Kartik Sharma - 3 years, 12 months ago

Log in to reply

Beside HnH_{n}? I have checked numerically, seems fine. Btw, my method is Summation By Parts only, if you look closely.

Ishan Singh - 3 years, 12 months ago

Log in to reply

@Ishan Singh The question is k=0n1(km)Hk\displaystyle \sum_{k=0}^{n-1}{\binom{k}{m} H_k} and not k=0n(km)Hk\displaystyle \sum_{k=0}^{n}{\binom{k}{m} H_k}.

Oh, indeed now I see. I was looking for the formal method, lol.

Kartik Sharma - 3 years, 12 months ago

Log in to reply

@Kartik Sharma Yes. But both sums imply each other :) Anyway, waiting for the next part.

Ishan Singh - 3 years, 12 months ago

Log in to reply

@Ishan Singh Then the answer is (nm+1)(Hn1m+1)\displaystyle \binom{n}{m+1}\left(H_n - \frac{1}{m+1}\right) which looks nice.

Kartik Sharma - 3 years, 12 months ago

Log in to reply

@Kartik Sharma Yeah, it can further be tidied up. I'll edit it. Btw, check out my solution of the latest problem based on Challenge 4.

Ishan Singh - 3 years, 11 months ago
×

Problem Loading...

Note Loading...

Set Loading...