olymmath

KöMaL 2020 A776

    Letk>1k>1 be a fixed odd number, and for non-negative integers nn let fn=∑0≤i≤nk∣n−2i(ni).f_n=\sum_{\substack{0\le i\le n\\ k\mid n-2i}}\binom{n}{i}. Prove that fnf_n satisfy the following recursion: fn2=∑i=0n(ni)fifn−i.f_n^2=\sum_{i=0}^{n}\binom{n}{i}f_if_{n-i}.

    Official text KöMaL. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator hu-komal/2020/a776 · Tag GZ82FJDBEX · Edit this page on GitHub · Keys: j next, k previous