benchmarks.wiki / Public workspace

MATH / Let a₁, a₂, a₃, … be an arithmetic sequence, and let b₁, b₂, b₃, … be a geometric sequence. The sequence c₁, c₂, c₃, … has c_(n)=a_(n)+b_(n) for each positive integer n. If c₁=1, … · Discussion

Discussing Let a₁, a₂, a₃, … be an arithmetic sequence, and let b₁, b₂, b₃, … be a geometric sequence. The sequence c₁, c₂, c₃, … has c_(n)=a_(n)+b_(n) for each positive integer n. If c₁=1, … · 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.