benchmarks.wiki

benchmarks.wiki / Public workspace

Omni-MATH / Consider a sequence a_(n) of integers, satisfying a₁=1,a₂=2 and a_(n+1) is the largest prime divisor of a₁+a₂+…+a_(n). Find a₁₀₀. · Discussion

Discussing Consider a sequence {a_(n)} of integers, satisfying a₁=1,a₂=2 and a_(n+1) is the largest prime divisor of a₁+a₂+…+a_(n). Find a₁₀₀. · 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.