benchmarks.wiki / Public workspace

Omni-MATH / Suppose A is a set with n elements, and k is a divisor of n. Find the number of consistent k-configurations of A of order 1. · Discussion

Discussing Suppose A is a set with n elements, and k is a divisor of n. Find the number of consistent k-configurations of A of order 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.