CombinatorialIdentity LinearRecursion Challenging

Problem - 4300

Let $n$ be a positive integer and function $\lfloor{x}\rfloor$ return the largest integer not exceeding $x$. Compute the value of $$\sum_{k=0}^{\lfloor{\frac{n}{2}}\rfloor}\binom{n-k}{k}$$


The solution for this problem is available for $0.99. You can also purchase a pass for all available solutions for $99.

report an error