benchmarks.wiki / Public workspace

Omni-MATH / Let n be the answer to this problem. Find the minimum number of colors needed to color the divisors of (n−24)! such that no two distinct divisors s,t of the same color satisfy s∣t. · Discussion

Discussing Let n be the answer to this problem. Find the minimum number of colors needed to color the divisors of (n−24)! such that no two distinct divisors s,t of the same color satisfy s∣t. · 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.