benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Pascal has a triangle. In the nth row, there are n+1 numbers a_(n,0),a_(n,1),a_(n,2),…,a_(n,n) where a_(n,0)=a_(n,n)=1. For all 1≤k≤n−1,a_(n,k)=a_(n−1,k)−a_(n−1,k−1). What is the s… · Discussion

Discussing Pascal has a triangle. In the nth row, there are n+1 numbers a_(n,0),a_(n,1),a_(n,2),…,a_(n,n) where a_(n,0)=a_(n,n)=1. For all 1≤k≤n−1,a_(n,k)=a_(n−1,k)−a_(n−1,k−1). What is the s… · Omni-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.