benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let C(k) denotes the sum of all different prime divisors of a positive integer k. For example, C(1)=0, C(2)=2,C(45)=8. Find all positive integers n such that C(2^(n)+1)=C(n) · Discussion

Discussing Let C(k) denotes the sum of all different prime divisors of a positive integer k. For example, C(1)=0, C(2)=2,C(45)=8. Find all positive integers n such that 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.