benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let f(n) be the number of ways to write n as a sum of powers of 2, where we keep track of the order of the summation. For example, f(4)=6 because 4 can be written as 4, 2+2, 2+1+1,… · Discussion

Discussing Let f(n) be the number of ways to write n as a sum of powers of 2, where we keep track of the order of the summation. For example, f(4)=6 because 4 can be written as 4, 2+2, 2+1+1,… · 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.