benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Determine the number of ways to select a sequence of 8 sets A₁,A₂,…,A₈, such that each is a subset (possibly empty) of …A_(m) contains A_(n) if m divides n. · Discussion

Discussing Determine the number of ways to select a sequence of 8 sets A₁,A₂,…,A₈, such that each is a subset (possibly empty) of …A_(m) contains A_(n) if m divides n. · 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.