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). · Discussion

Discussing 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). · 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.