benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / For each positive integer k denote C(k) to be sum of its distinct prime divisors. For example C(1)=0,C(2)=2,C(45)=8. Find all positive integers n for which C(2^(n)+1)=C(n).

Problem

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

problem

For each positive integer kk denote C(k)C(k) to be sum of its distinct prime divisors. For example C(1)=0,C(2)=2,C(45)=8C(1)=0,C(2)=2,C(45)=8. Find all positive integers nn for which C(2n+1)=C(n)C(2^n+1)=C(n).
Plain-text mathematical notation (without MathML)
For each positive integer k denote C(k) to be sum of its distinct prime divisors. For example C(1)=0,C(2)=2,C(45)=8. Find all positive integers n for which C(2^(n)+1)=C(n).
Original LaTeX notation
For each positive integer $k$ denote $C(k)$ to be sum of its distinct prime divisors. For example $C(1)=0,C(2)=2,C(45)=8$. Find all positive integers $n$ for which $C(2^n+1)=C(n)$.

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
d1cb02be-c2dc-52dd-b678-9b054701f11d
task_key
test--d1cb02be-c2dc-52dd-b678-9b054701f11d
task_revision_id
1
config / split
/ test

Official source

initial import