benchmarks.wiki / Public workspace

MATH / Let f(m,1)=f(1,n)=1 for m≥1,n≥1, and let f(m,n)=f(m−1,n)+f(m,n−1)+f(m−1,n−1) for m>1 and n>1. Also, let S(k)=∑_(a+b=k)f(a,b), for a≥1,b≥1.Note: The summation notation means to sum … · Discussion

Discussing Let f(m,1)=f(1,n)=1 for m≥1,n≥1, and let f(m,n)=f(m−1,n)+f(m,n−1)+f(m−1,n−1) for m>1 and n>1. Also, let S(k)=∑_(a+b=k)f(a,b), for a≥1,b≥1.Note: The summation notation means to sum … · MATH

Posts

Chronological order within this page.

Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.