benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Let d(n) denote the number of positive divisors of n. For positive integer n we define f(n) as f(n)=d(k₁)+d(k₂)+⋯+d(k_(m)), where 1=k₁<k₂<⋯<k_(m)=n are all divisors of the number n… · Discussion

Discussing Let d(n) denote the number of positive divisors of n. For positive integer n we define f(n) as f(n)=d(k₁)+d(k₂)+⋯+d(k_(m)), where 1=k₁<k₂<⋯<k_(m)=n are all divisors of the number 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.