benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / For each positive integer 1≤m≤10, Krit chooses an integer 0≤a_(m)<m uniformly at random. Let p be the probability that there exists an integer n for which n equiv a_m(bmod m) for… · Discussion

Discussing For each positive integer 1≤m≤10, Krit chooses an integer 0≤a_(m)<m uniformly at random. Let p be the probability that there exists an integer n for which n equiv a_{m}(bmod m) for… · 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.