benchmarks.wiki / Public workspace

Omni-MATH / There are n≥2 coins, each with a different positive integer value. Call an integer m sticky if some subset of these n coins have total value m. We call the entire set of coins a st… · Discussion

Discussing There are n≥2 coins, each with a different positive integer value. Call an integer m sticky if some subset of these n coins have total value m. We call the entire set of coins a st… · 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.