benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / For every positive integer n with prime factorization n=∏_(i=1)^(k)p_(i)^(α_(i)), define mho(n) = sum_i: ; p_i > 10^100 alpha_i. That is, mho(n) is the number of prime factors … · Discussion

Discussing For every positive integer n with prime factorization n=∏_(i=1)^(k)p_(i)^(α_(i)), define mho(n) = sum_{i: ; p_i > 10^{100}} alpha_i. That is, mho(n) is the number of prime factors … · 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.