In an arithmetic sequence, every pair of consecutive terms differs by a fixed number c, so that the n-th term is given recursively by
Then for n ≥ 2, we have
and so on, up to
Given that and , we can solve for :
5.7m questions
7.4m answers