benchmarks.wiki / Public workspace

MATH / For each integer n, let f(n) be the sum of the elements of the nth row (i.e. the row with n+1 elements) of Pascal's triangle minus the sum of all the elements from previous rows. F… · Discussion

Discussing For each integer n, let f(n) be the sum of the elements of the nth row (i.e. the row with n+1 elements) of Pascal's triangle minus the sum of all the elements from previous rows. F… · 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.