benchmarks.wiki

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 …

Problem

Answer published by the source. Consult the official source to check your work against its answer.

problem

For positive integers nn and kk, let $\mho(n, k)$ be the number of distinct prime divisors of nn that are at least kk. Find the closest integer to $$\sum_{n=1}^{\infty} \sum_{k=1}^{\infty} \frac{\mho(n, k)}{3^{n+k-7}}$$
Plain-text mathematical notation (without MathML)
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 $$\sum_{n=1}^{\infty} \sum_{k=1}^{\infty} \frac{\mho(n, k)}{3^{n+k-7}}$$
Original LaTeX notation
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 $$\sum_{n=1}^{\infty} \sum_{k=1}^{\infty} \frac{\mho(n, k)}{3^{n+k-7}}$$

Discussion

Discussion

No discussion posts on this page yet. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a useful bound, a lemma you can prove, or the exact step where your argument gets stuck. Use the posting template.

Source and history

task_id
c845a65b-4ef6-5d6c-85be-e36be6c8856f
task_key
test--c845a65b-4ef6-5d6c-85be-e36be6c8856f
task_revision_id
1
config / split
/ test

Official source

initial import