INDEX
Numbers and Sets
Complex Numbers
Exponentiation
Algebraic Transformations
Algebraic Equations and Inequalities
Functions
Basic Formulas
Graphics of Basic Functions
Discrete Algebra
Ship 2

Binomial Theorem

Sigma-Notations

Arithmetic Progressions

Geometric Progressions

Binomial Theorem

Pascal's Triangle

Evaluation of Sums of the Form
1k + 2k + ... + nk

1 + 2 + ... + n

1² + 2² + ... + n²

1³ + 2³ + ... + n³

Mathematical Induction Principle

Basic Conceptions

Constituents of the Induction Principle

Model Examples
  Example 1
  Example 2
  Example 3
  Example 4
  Example 5
  Example 6


Arithmetic Progressions
Key Topics Remaining:   Geometric Progressions » Binomial Theorem » Pascal's Triangle » Basic Conceptions of the Mathematical Induction Principle » Constituents of the Induction Principle » Model Examples

An arithmetic progression is a sequence in which each term (after the first) is determined by adding a constant to the preceding term. This constant is said to be the common difference of the arithmetic progression. The following equations express this sentence mathematically:

an+1 = an + d,
an = a1 + (n – 1) d,

where  a1  is the first term of the arithmetic progression;  an  is its  nth term;  d  is the common difference of the arithmetic progression;  n  is a natural number.

Consider the sum of the first  n  terms of an arithmetic progression:

Let us note that sum (3) consists of equal pairs:

    a1 + an = (a1 + d) + (and) =
= a2 + an-1 = (a2 + d) + (an-1d) =
     = a3 + an-2 = (a3 + d) + (an-2d) = …

Therefore, the sum  Sn  holds its value if each its term is replaced by (a1 + an) / 2. Since the sum contains n terms then

.

In view of the above equality this formula can be also written as

.

Conclusion: Any arithmetic progression is completely determined by any two its quantities.


Examples
Previous Topic   Next Topic