benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let S be a set of intervals defined recursively as follows: Initially, [1,1000] is the only interval in S. If l≠r and [l,r]∈S, then both [l,⌊(l+r)/(2)⌋],[⌊(l+r)/(2)⌋+1,r]∈S. An int… · Discussion

Discussing Let S be a set of intervals defined recursively as follows: Initially, [1,1000] is the only interval in S. If l≠r and [l,r]∈S, then both [l,⌊(l+r)/(2)⌋],[⌊(l+r)/(2)⌋+1,r]∈S. An int… · 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.