benchmarks.wiki / Public workspace

Omni-MATH / For positive integers n and k, let mho(n, k) be the number of distinct prime divisors of n that are at least k. Find the closest integer to … · Discussion

Discussing For positive integers n and k, let mho(n, k) be the number of distinct prime divisors of n that are at least k. Find the closest integer to … · 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.