Waste less time on Facebook — follow Brilliant.
×

A combinatorial identity (teaser?)

\[\sum_{k=1}^{n-1} H_{k}H_{n-k} \equiv 2\sum_{k=1}^{n-1} H_{k}\frac{n-k}{k+1}\]

Try to prove it! If you want to know how I proved it, get this thread to hit 20 replies saying "Asuka best grill :^)" and the question mark will go away ;)

(\(H_{n} = \frac{1}{1}+\frac{1}{2}+\ldots+\frac{1}{n}\))

Note by Jake Lai
1 year, 5 months ago

No vote yet
1 vote

Comments

Sort by:

Top Newest

The only question mark in your note is in the title. Lee Gao · 1 year, 2 months ago

Log in to reply

Rei best grill Goran Nand · 1 year, 5 months ago

Log in to reply

@Goran Nand What shit taste ;c Jake Lai · 1 year, 5 months ago

Log in to reply

@Jake Lai Likewise my friend Goran Nand · 1 year, 5 months ago

Log in to reply

×

Problem Loading...

Note Loading...

Set Loading...