Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 94 tok/s
Gemini 2.5 Pro 53 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 18 tok/s Pro
GPT-4o 101 tok/s Pro
Kimi K2 222 tok/s Pro
GPT OSS 120B 449 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

New developments of an old identity (1203.5424v4)

Published 24 Mar 2012 in math.CO

Abstract: We give a direct combinatorial proof of a famous identity, $$ \sum_{i+j=n} m{2i}{i} \binom{2j}{j} = 4n $$ by actually counting pairs of $k$-subsets of $2k$-sets. Then we discuss two different generalizations of the identity, and end the paper by presenting in explicit form the ordinary generating function of the sequence $(\strut\binom{2n+k}{n})_{n\in\mathds{N}_0}$, where $k\in\mathds{R}$.

Summary

We haven't generated a summary for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Lightbulb On Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.