benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / To every natural number k,k≥2, there corresponds a sequence a_(n)(k) according to the following rule: a₀=k, a_(n)=τ(a_(n−1)) ∀n≥1, in which τ(a) is the number of different divisors… · Discussion

Discussing To every natural number k,k≥2, there corresponds a sequence a_(n)(k) according to the following rule: a₀=k, a_(n)=τ(a_(n−1)) ∀n≥1, in which τ(a) is the number of different divisors… · 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.