Algorithm for calculating the inverse matrix using algebraic additions: the adjoint matrix method. Solving matrices Arithmetic progression. briefly about the main thing

Matrix determinant

Finding the determinant of a matrix is ​​a very common problem in higher mathematics and algebra. As a rule, one cannot do without the value of the matrix determinant when solving complex systems of equations. The Cramer method for solving systems of equations is based on calculating the determinant of a matrix. Using the definition of a determinant, the existence and uniqueness of a solution to a system of equations is determined. Therefore, it is difficult to overestimate the importance of the ability to correctly and accurately find the determinant of a matrix in mathematics. Methods for solving determinants are theoretically quite simple, but as the size of the matrix increases, the calculations become very cumbersome and require great care and a lot of time. It is very easy to make a minor mistake or typo in such complex mathematical calculations, which will lead to an error in the final answer. So even if you find matrix determinant yourself, it is important to check the result. This can be done with our service Finding the determinant of a matrix online. Our service always produces absolutely accurate results, containing no errors or clerical errors. You can refuse independent calculations, because from an applied point of view, finding determinant of the matrix It is not educational in nature, but simply requires a lot of time and numerical calculations. Therefore, if in your task definition of matrix determinant are auxiliary, side calculations, use our service and find the determinant of a matrix online!

All calculations are carried out automatically with the highest accuracy and are absolutely free. We have a very convenient interface for entering matrix elements. But the main difference between our service and similar ones is the possibility of obtaining a detailed solution. Our service at calculating the determinant of a matrix online always uses the simplest and shortest method and describes in detail each step of transformations and simplifications. So you get not just the value of the determinant of the matrix, the final result, but also a whole detailed solution.

Matrix A -1 is called the inverse matrix with respect to matrix A if A*A -1 = E, where E is the identity matrix of the nth order. An inverse matrix can only exist for square matrices.

Purpose of the service. Using this service online you can find algebraic complements, transposed matrix A T, allied matrix and inverse matrix. The decision is carried out directly on the website (online) and is free. The calculation results are presented in a report in Word and Excel format (i.e., it is possible to check the solution). see design example.

Instructions. To obtain a solution, it is necessary to specify the dimension of the matrix. Next, fill out matrix A in the new dialog box.

See also Inverse matrix using the Jordano-Gauss method

Algorithm for finding the inverse matrix

1. Finding the transposed matrix A T .
2. Definition of algebraic complements. Replace each element of the matrix with its algebraic complement.
3. Compiling an inverse matrix from algebraic additions: each element of the resulting matrix is ​​divided by the determinant of the original matrix. The resulting matrix is ​​the inverse of the original matrix.

Next algorithm for finding the inverse matrix similar to the previous one except for some steps: first the algebraic complements are calculated, and then the allied matrix C is determined.

1. Determine whether the matrix is ​​square. If not, then there is no inverse matrix for it.
2. Calculation of the determinant of the matrix A. If it is not equal to zero, we continue the solution, otherwise the inverse matrix does not exist.
3. Definition of algebraic complements.
4. Filling out the union (mutual, adjoint) matrix C .
5. Compiling an inverse matrix from algebraic additions: each element of the adjoint matrix C is divided by the determinant of the original matrix. The resulting matrix is ​​the inverse of the original matrix.
6. They do a check: they multiply the original and resulting matrices. The result should be an identity matrix.

Example No. 1. Let's write the matrix in the form:

Algebraic additions. ∆ 1.2 = -(2·4-(-2·(-2))) = -4 ∆ 2.1 = -(2 4-5 3) = 7 ∆ 2.3 = -(-1 5-(-2 2)) = 1 ∆ 3.2 = -(-1·(-2)-2·3) = 4

A -1 =

0,6 -0,4 0,8 0,7 0,2 0,1 -0,1 0,4 -0,3

Another algorithm for finding the inverse matrix

Let us present another scheme for finding the inverse matrix.

1. Find the determinant of a given square matrix A.
2. We find algebraic complements to all elements of the matrix A.
3. We write algebraic additions of row elements to columns (transposition).
4. We divide each element of the resulting matrix by the determinant of the matrix A.

As we see, the transposition operation can be applied both at the beginning, on the original matrix, and at the end, on the resulting algebraic additions.

A special case: The inverse of the identity matrix E is the identity matrix E.

The matrix $A^(-1)$ is called the inverse of the square matrix $A$ if the condition $A^(-1)\cdot A=A\cdot A^(-1)=E$ is satisfied, where $E $ is the identity matrix, the order of which is equal to the order of the matrix $A$.

A non-singular matrix is ​​a matrix whose determinant is not equal to zero. Accordingly, a singular matrix is ​​one whose determinant is equal to zero.

The inverse matrix $A^(-1)$ exists if and only if the matrix $A$ is non-singular. If the inverse matrix $A^(-1)$ exists, then it is unique.

There are several ways to find the inverse of a matrix, and we will look at two of them. This page will discuss the adjoint matrix method, which is considered standard in most higher mathematics courses. The second method of finding the inverse matrix (the method of elementary transformations), which involves using the Gauss method or the Gauss-Jordan method, is discussed in the second part.

Adjoint matrix method

Let the matrix $A_(n\times n)$ be given. In order to find the inverse matrix $A^(-1)$, three steps are required:

1. Find the determinant of the matrix $A$ and make sure that $\Delta A\neq 0$, i.e. that matrix A is non-singular.
2. Compose algebraic complements $A_(ij)$ of each element of the matrix $A$ and write the matrix $A_(n\times n)^(*)=\left(A_(ij) \right)$ from the found algebraic complements.
3. Write the inverse matrix taking into account the formula $A^(-1)=\frac(1)(\Delta A)\cdot (A^(*))^T$.

The matrix $(A^(*))^T$ is often called adjoint (reciprocal, allied) to the matrix $A$.

If the solution is done manually, then the first method is good only for matrices of relatively small orders: second (), third (), fourth (). To find the inverse of a higher order matrix, other methods are used. For example, the Gaussian method, which is discussed in the second part.

Example No. 1

Find the inverse of matrix $A=\left(\begin(array) (cccc) 5 & -4 &1 & 0 \\ 12 &-11 &4 & 0 \\ -5 & 58 &4 & 0 \\ 3 & - 1 & -9 & 0 \end(array) \right)$.

Since all elements of the fourth column are equal to zero, then $\Delta A=0$ (i.e. the matrix $A$ is singular). Since $\Delta A=0$, there is no inverse matrix to matrix $A$.

Answer: matrix $A^(-1)$ does not exist.

Example No. 2

Find the inverse of matrix $A=\left(\begin(array) (cc) -5 & 7 \\ 9 & 8 \end(array)\right)$. Perform check.

We use the adjoint matrix method. First, let's find the determinant of the given matrix $A$:

$$ \Delta A=\left| \begin(array) (cc) -5 & 7\\ 9 & 8 \end(array)\right|=-5\cdot 8-7\cdot 9=-103. $$

Since $\Delta A \neq 0$, then the inverse matrix exists, therefore we will continue the solution. Finding algebraic complements

\begin(aligned) & A_(11)=(-1)^2\cdot 8=8; \; A_(12)=(-1)^3\cdot 9=-9;\\ & A_(21)=(-1)^3\cdot 7=-7; \; A_(22)=(-1)^4\cdot (-5)=-5.\\ \end(aligned)

We compose a matrix of algebraic additions: $A^(*)=\left(\begin(array) (cc) 8 & -9\\ -7 & -5 \end(array)\right)$.

We transpose the resulting matrix: $(A^(*))^T=\left(\begin(array) (cc) 8 & -7\\ -9 & -5 \end(array)\right)$ (the resulting matrix is ​​often is called the adjoint or allied matrix to the matrix $A$). Using the formula $A^(-1)=\frac(1)(\Delta A)\cdot (A^(*))^T$, we have:

$$ A^(-1)=\frac(1)(-103)\cdot \left(\begin(array) (cc) 8 & -7\\ -9 & -5 \end(array)\right) =\left(\begin(array) (cc) -8/103 & 7/103\\ 9/103 & 5/103 \end(array)\right) $$

So, the inverse matrix is ​​found: $A^(-1)=\left(\begin(array) (cc) -8/103 & 7/103\\ 9/103 & 5/103 \end(array)\right) $. To check the truth of the result, it is enough to check the truth of one of the equalities: $A^(-1)\cdot A=E$ or $A\cdot A^(-1)=E$. Let's check the equality $A^(-1)\cdot A=E$. In order to work less with fractions, we will substitute the matrix $A^(-1)$ not in the form $\left(\begin(array) (cc) -8/103 & 7/103\\ 9/103 & 5/103 \ end(array)\right)$, and in the form $-\frac(1)(103)\cdot \left(\begin(array) (cc) 8 & -7\\ -9 & -5 \end(array )\right)$:

$$ A^(-1)\cdot(A) =-\frac(1)(103)\cdot \left(\begin(array) (cc) 8 & -7\\ -9 & -5 \end( array)\right)\cdot\left(\begin(array) (cc) -5 & 7 \\ 9 & 8 \end(array)\right) =-\frac(1)(103)\cdot\left( \begin(array) (cc) -103 & 0 \\ 0 & -103 \end(array)\right) =\left(\begin(array) (cc) 1 & 0 \\ 0 & 1 \end(array )\right) =E $$

Answer: $A^(-1)=\left(\begin(array) (cc) -8/103 & 7/103\\ 9/103 & 5/103 \end(array)\right)$.

Example No. 3

Find the inverse matrix for the matrix $A=\left(\begin(array) (ccc) 1 & 7 & 3 \\ -4 & 9 & 4 \\ 0 & 3 & 2\end(array) \right)$. Perform check.

Let's start by calculating the determinant of the matrix $A$. So, the determinant of the matrix $A$ is:

$$ \Delta A=\left| \begin(array) (ccc) 1 & 7 & 3 \\ -4 & 9 & 4 \\ 0 & 3 & 2\end(array) \right| = 18-36+56-12=26. $$

Since $\Delta A\neq 0$, then the inverse matrix exists, therefore we will continue the solution. We find the algebraic complements of each element of a given matrix:

$$ \begin(aligned) & A_(11)=(-1)^(2)\cdot\left|\begin(array)(cc) 9 & 4\\ 3 & 2\end(array)\right| =6;\; A_(12)=(-1)^(3)\cdot\left|\begin(array)(cc) -4 &4 \\ 0 & 2\end(array)\right|=8;\; A_(13)=(-1)^(4)\cdot\left|\begin(array)(cc) -4 & 9\\ 0 & 3\end(array)\right|=-12;\\ & A_(21)=(-1)^(3)\cdot\left|\begin(array)(cc) 7 & 3\\ 3 & 2\end(array)\right|=-5;\; A_(22)=(-1)^(4)\cdot\left|\begin(array)(cc) 1 & 3\\ 0 & 2\end(array)\right|=2;\; A_(23)=(-1)^(5)\cdot\left|\begin(array)(cc) 1 & 7\\ 0 & 3\end(array)\right|=-3;\\ & A_ (31)=(-1)^(4)\cdot\left|\begin(array)(cc) 7 & 3\\ 9 & 4\end(array)\right|=1;\; A_(32)=(-1)^(5)\cdot\left|\begin(array)(cc) 1 & 3\\ -4 & 4\end(array)\right|=-16;\; A_(33)=(-1)^(6)\cdot\left|\begin(array)(cc) 1 & 7\\ -4 & 9\end(array)\right|=37. \end(aligned) $$

We compose a matrix of algebraic additions and transpose it:

$$ A^*=\left(\begin(array) (ccc) 6 & 8 & -12 \\ -5 & 2 & -3 \\ 1 & -16 & 37\end(array) \right); \; (A^*)^T=\left(\begin(array) (ccc) 6 & -5 & 1 \\ 8 & 2 & -16 \\ -12 & -3 & 37\end(array) \right) . $$

Using the formula $A^(-1)=\frac(1)(\Delta A)\cdot (A^(*))^T$, we get:

$$ A^(-1)=\frac(1)(26)\cdot \left(\begin(array) (ccc) 6 & -5 & 1 \\ 8 & 2 & -16 \\ -12 & - 3 & 37\end(array) \right)= \left(\begin(array) (ccc) 3/13 & -5/26 & 1/26 \\ 4/13 & 1/13 & -8/13 \ \ -6/13 & -3/26 & 37/26 \end(array) \right) $$

So $A^(-1)=\left(\begin(array) (ccc) 3/13 & -5/26 & 1/26 \\ 4/13 & 1/13 & -8/13 \\ - 6/13 & -3/26 & 37/26 \end(array) \right)$. To check the truth of the result, it is enough to check the truth of one of the equalities: $A^(-1)\cdot A=E$ or $A\cdot A^(-1)=E$. Let's check the equality $A\cdot A^(-1)=E$. In order to work less with fractions, we will substitute the matrix $A^(-1)$ not in the form $\left(\begin(array) (ccc) 3/13 & -5/26 & 1/26 \\ 4/13 & 1/13 & -8/13 \\ -6/13 & -3/26 & 37/26 \end(array) \right)$, and in the form $\frac(1)(26)\cdot \left( \begin(array) (ccc) 6 & -5 & 1 \\ 8 & 2 & -16 \\ -12 & -3 & 37\end(array) \right)$:

$$ A\cdot(A^(-1)) =\left(\begin(array)(ccc) 1 & 7 & 3 \\ -4 & 9 & 4\\ 0 & 3 & 2\end(array) \right)\cdot \frac(1)(26)\cdot \left(\begin(array) (ccc) 6 & -5 & 1 \\ 8 & 2 & -16 \\ -12 & -3 & 37\ end(array) \right) =\frac(1)(26)\cdot\left(\begin(array) (ccc) 26 & 0 & 0 \\ 0 & 26 & 0 \\ 0 & 0 & 26\end (array) \right) =\left(\begin(array) (ccc) 1 & 0 & 0 \\ 0 & 1 & 0 \\ 0 & 0 & 1\end(array) \right) =E $$

The check was successful, the inverse matrix $A^(-1)$ was found correctly.

Answer: $A^(-1)=\left(\begin(array) (ccc) 3/13 & -5/26 & 1/26 \\ 4/13 & 1/13 & -8/13 \\ -6 /13 & -3/26 & 37/26 \end(array) \right)$.

Example No. 4

Find the matrix inverse of matrix $A=\left(\begin(array) (cccc) 6 & -5 & 8 & 4\\ 9 & 7 & 5 & 2 \\ 7 & 5 & 3 & 7\\ -4 & 8 & -8 & -3 \end(array) \right)$.

For a fourth-order matrix, finding the inverse matrix using algebraic additions is somewhat difficult. However, such examples do occur in test papers.

To find the inverse of a matrix, you first need to calculate the determinant of the matrix $A$. The best way to do this in this situation is to expand the determinant along a row (column). We select any row or column and find the algebraic complements of each element of the selected row or column.

For example, for the first line we get:

$$ A_(11)=\left|\begin(array)(ccc) 7 & 5 & 2\\ 5 & 3 & 7\\ 8 & -8 & -3 \end(array)\right|=556; \; A_(12)=-\left|\begin(array)(ccc) 9 & 5 & 2\\ 7 & 3 & 7 \\ -4 & -8 & -3 \end(array)\right|=-300 ; $$ $$ A_(13)=\left|\begin(array)(ccc) 9 & 7 & 2\\ 7 & 5 & 7\\ -4 & 8 & -3 \end(array)\right|= -536;\; A_(14)=-\left|\begin(array)(ccc) 9 & 7 & 5\\ 7 & 5 & 3\\ -4 & 8 & -8 \end(array)\right|=-112. $$

The determinant of the matrix $A$ is calculated using the following formula:

$$ \Delta(A)=a_(11)\cdot A_(11)+a_(12)\cdot A_(12)+a_(13)\cdot A_(13)+a_(14)\cdot A_(14 )=6\cdot 556+(-5)\cdot(-300)+8\cdot(-536)+4\cdot(-112)=100. $$

$$ \begin(aligned) & A_(21)=-77;\;A_(22)=50;\;A_(23)=87;\;A_(24)=4;\\ & A_(31) =-93;\;A_(32)=50;\;A_(33)=83;\;A_(34)=36;\\ & A_(41)=473;\;A_(42)=-250 ;\;A_(43)=-463;\;A_(44)=-96. \end(aligned) $$

Matrix of algebraic complements: $A^*=\left(\begin(array)(cccc) 556 & -300 & -536 & -112\\ -77 & 50 & 87 & 4 \\ -93 & 50 & 83 & 36\\ 473 & -250 & -463 & -96\end(array)\right)$.

Adjoint matrix: $(A^*)^T=\left(\begin(array) (cccc) 556 & -77 & -93 & 473\\ -300 & 50 & 50 & -250 \\ -536 & 87 & 83 & -463\\ -112 & 4 & 36 & -96\end(array)\right)$.

Inverse matrix:

$$ A^(-1)=\frac(1)(100)\cdot \left(\begin(array) (cccc) 556 & -77 & -93 & 473\\ -300 & 50 & 50 & -250 \\ -536 & 87 & 83 & -463\\ -112 & 4 & 36 & -96 \end(array) \right)= \left(\begin(array) (cccc) 139/25 & -77/100 & -93/100 & 473/100 \\ -3 & 1/2 & 1/2 & -5/2 \\ -134/25 & 87/100 & 83/100 & -463/100 \\ -28/ 25 & 1/25 & 9/25 & -24/25 \end(array) \right) $$

The check, if desired, can be done in the same way as in the previous examples.

Answer: $A^(-1)=\left(\begin(array) (cccc) 139/25 & -77/100 & -93/100 & 473/100 \\ -3 & 1/2 & 1/2 & -5/2 \\ -134/25 & 87/100 & 83/100 & -463/100 \\ -28/25 & 1/25 & 9/25 & -24/25 \end(array) \right) $.

In the second part, we will consider another way to find the inverse matrix, which involves the use of transformations of the Gaussian method or the Gauss-Jordan method.

Yes, yes: arithmetic progression is not a toy for you :)

Well, friends, if you are reading this text, then the internal cap-evidence tells me that you do not yet know what an arithmetic progression is, but you really (no, like that: SOOOOO!) want to know. Therefore, I will not torment you with long introductions and will get straight to the point.

First, a couple of examples. Let's look at several sets of numbers:

• 1; 2; 3; 4; ...
• 15; 20; 25; 30; ...
• $\sqrt(2);\ 2\sqrt(2);\ 3\sqrt(2);...$

What do all these sets have in common? At first glance, nothing. But actually there is something. Namely: each next element differs from the previous one by the same number.

Judge for yourself. The first set is simply consecutive numbers, each next being one more than the previous one. In the second case, the difference between adjacent numbers is already five, but this difference is still constant. In the third case, there are roots altogether. However, $2\sqrt(2)=\sqrt(2)+\sqrt(2)$, and $3\sqrt(2)=2\sqrt(2)+\sqrt(2)$, i.e. and in this case, each next element simply increases by $\sqrt(2)$ (and don’t be afraid that this number is irrational).

So: all such sequences are called arithmetic progressions. Let's give a strict definition:

Definition. A sequence of numbers in which each next one differs from the previous one by exactly the same amount is called an arithmetic progression. The very amount by which the numbers differ is called the progression difference and is most often denoted by the letter $d$.

Notation: $\left(((a)_(n)) \right)$ is the progression itself, $d$ is its difference.

And just a couple of important notes. Firstly, progression is only considered ordered sequence of numbers: they are allowed to be read strictly in the order in which they are written - and nothing else. Numbers cannot be rearranged or swapped.

Secondly, the sequence itself can be either finite or infinite. For example, the set (1; 2; 3) is obviously a finite arithmetic progression. But if you write something in the spirit (1; 2; 3; 4; ...) - this is already an infinite progression. The ellipsis after the four seems to hint that there are quite a few more numbers to come. Infinitely many, for example. :)

I would also like to note that progressions can be increasing or decreasing. We have already seen increasing ones - the same set (1; 2; 3; 4; ...). Here are examples of decreasing progressions:

• 49; 41; 33; 25; 17; ...
• 17,5; 12; 6,5; 1; −4,5; −10; ...
• $\sqrt(5);\ \sqrt(5)-1;\ \sqrt(5)-2;\ \sqrt(5)-3;...$

Okay, okay: the last example may seem overly complicated. But the rest, I think, you understand. Therefore, we introduce new definitions:

Definition. An arithmetic progression is called:

1. increasing if each next element is greater than the previous one;
2. decreasing if, on the contrary, each subsequent element is less than the previous one.

In addition, there are so-called “stationary” sequences - they consist of the same repeating number. For example, (3; 3; 3; ...).

Only one question remains: how to distinguish an increasing progression from a decreasing one? Fortunately, everything here depends only on the sign of the number $d$, i.e. progression differences:

1. If $d \gt 0$, then the progression increases;
2. If $d \lt 0$, then the progression is obviously decreasing;
3. Finally, there is the case $d=0$ - in this case the entire progression is reduced to a stationary sequence of identical numbers: (1; 1; 1; 1; ...), etc.

Let's try to calculate the difference $d$ for the three decreasing progressions given above. To do this, it is enough to take any two adjacent elements (for example, the first and second) and subtract the number on the left from the number on the right. It will look like this:

• 41−49=−8;
• 12−17,5=−5,5;
• $\sqrt(5)-1-\sqrt(5)=-1$.

As we can see, in all three cases the difference actually turned out to be negative. And now that we have more or less figured out the definitions, it’s time to figure out how progressions are described and what properties they have.

Progression terms and recurrence formula

Since the elements of our sequences cannot be swapped, they can be numbered:

\[\left(((a)_(n)) \right)=\left\( ((a)_(1)),\ ((a)_(2)),((a)_(3 )),... \right\)\]

The individual elements of this set are called members of a progression. They are indicated by a number: first member, second member, etc.

In addition, as we already know, neighboring terms of the progression are related by the formula:

\[((a)_(n))-((a)_(n-1))=d\Rightarrow ((a)_(n))=((a)_(n-1))+d \]

In short, to find the $n$th term of a progression, you need to know the $n-1$th term and the difference $d$. This formula is called recurrent, because with its help you can find any number only by knowing the previous one (and in fact, all the previous ones). This is very inconvenient, so there is a more cunning formula that reduces any calculations to the first term and the difference:

\[((a)_(n))=((a)_(1))+\left(n-1 \right)d\]

You've probably already come across this formula. They like to give it in all sorts of reference books and solution books. And in any sensible mathematics textbook it is one of the first.

However, I suggest you practice a little.

Task No. 1. Write down the first three terms of the arithmetic progression $\left(((a)_(n)) \right)$ if $((a)_(1))=8,d=-5$.

Solution. So, we know the first term $((a)_(1))=8$ and the difference of the progression $d=-5$. Let's use the formula just given and substitute $n=1$, $n=2$ and $n=3$:

\[\begin(align) & ((a)_(n))=((a)_(1))+\left(n-1 \right)d; \\ & ((a)_(1))=((a)_(1))+\left(1-1 \right)d=((a)_(1))=8; \\ & ((a)_(2))=((a)_(1))+\left(2-1 \right)d=((a)_(1))+d=8-5= 3; \\ & ((a)_(3))=((a)_(1))+\left(3-1 \right)d=((a)_(1))+2d=8-10= -2. \\ \end(align)\]

Answer: (8; 3; −2)

That's all! Please note: our progression is decreasing.

Of course, $n=1$ could not be substituted - the first term is already known to us. However, by substituting unity, we were convinced that even for the first term our formula works. In other cases, everything came down to banal arithmetic.

Task No. 2. Write down the first three terms of an arithmetic progression if its seventh term is equal to −40 and its seventeenth term is equal to −50.

Solution. Let's write the problem condition in familiar terms:

\[((a)_(7))=-40;\quad ((a)_(17))=-50.\]

\[\left\( \begin(align) & ((a)_(7))=((a)_(1))+6d \\ & ((a)_(17))=((a) _(1))+16d \\ \end(align) \right.\]

\[\left\( \begin(align) & ((a)_(1))+6d=-40 \\ & ((a)_(1))+16d=-50 \\ \end(align) \right.\]

I put the system sign because these requirements must be met simultaneously. Now let’s note that if we subtract the first from the second equation (we have the right to do this, since we have a system), we get this:

\[\begin(align) & ((a)_(1))+16d-\left(((a)_(1))+6d \right)=-50-\left(-40 \right); \\ & ((a)_(1))+16d-((a)_(1))-6d=-50+40; \\&10d=-10; \\&d=-1. \\ \end(align)\]

That's how easy it is to find the progression difference! All that remains is to substitute the found number into any of the equations of the system. For example, in the first:

\[\begin(matrix) ((a)_(1))+6d=-40;\quad d=-1 \\ \Downarrow \\ ((a)_(1))-6=-40; \\ ((a)_(1))=-40+6=-34. \\ \end(matrix)\]

Now, knowing the first term and the difference, it remains to find the second and third terms:

\[\begin(align) & ((a)_(2))=((a)_(1))+d=-34-1=-35; \\ & ((a)_(3))=((a)_(1))+2d=-34-2=-36. \\ \end(align)\]

Ready! The problem is solved.

Answer: (−34; −35; −36)

Notice the interesting property of progression that we discovered: if we take the $n$th and $m$th terms and subtract them from each other, we get the difference of the progression multiplied by the number $n-m$:

\[((a)_(n))-((a)_(m))=d\cdot \left(n-m \right)\]

A simple but very useful property that you definitely need to know - with its help you can significantly speed up the solution of many progression problems. Here is a clear example of this:

Task No. 3. The fifth term of an arithmetic progression is 8.4, and its tenth term is 14.4. Find the fifteenth term of this progression.

Solution. Since $((a)_(5))=8.4$, $((a)_(10))=14.4$, and we need to find $((a)_(15))$, we note following:

\[\begin(align) & ((a)_(15))-((a)_(10))=5d; \\ & ((a)_(10))-((a)_(5))=5d. \\ \end(align)\]

But by condition $((a)_(10))-((a)_(5))=14.4-8.4=6$, therefore $5d=6$, from which we have:

\[\begin(align) & ((a)_(15))-14,4=6; \\ & ((a)_(15))=6+14.4=20.4. \\ \end(align)\]

Answer: 20.4

That's all! We didn’t need to create any systems of equations and calculate the first term and the difference - everything was solved in just a couple of lines.

Now let's look at another type of problem - searching for negative and positive terms of a progression. It is no secret that if a progression increases, and its first term is negative, then sooner or later positive terms will appear in it. And vice versa: the terms of a decreasing progression will sooner or later become negative.

At the same time, it is not always possible to find this moment “head-on” by sequentially going through the elements. Often, problems are written in such a way that without knowing the formulas, the calculations would take several sheets of paper—we would simply fall asleep while we found the answer. Therefore, let's try to solve these problems in a faster way.

Task No. 4. How many negative terms are there in the arithmetic progression −38.5; −35.8; ...?

Solution. So, $((a)_(1))=-38.5$, $((a)_(2))=-35.8$, from where we immediately find the difference:

Note that the difference is positive, so the progression increases. The first term is negative, so indeed at some point we will stumble upon positive numbers. The only question is when this will happen.

Let's try to find out how long (i.e. up to what natural number $n$) the negativity of the terms remains:

\[\begin(align) & ((a)_(n)) \lt 0\Rightarrow ((a)_(1))+\left(n-1 \right)d \lt 0; \\ & -38.5+\left(n-1 \right)\cdot 2.7 \lt 0;\quad \left| \cdot 10 \right. \\ & -385+27\cdot \left(n-1 \right) \lt 0; \\ & -385+27n-27 \lt 0; \\ & 27n \lt 412; \\ & n \lt 15\frac(7)(27)\Rightarrow ((n)_(\max ))=15. \\ \end(align)\]

The last line requires some explanation. So we know that $n \lt 15\frac(7)(27)$. On the other hand, we are satisfied with only integer values ​​of the number (moreover: $n\in \mathbb(N)$), so the largest permissible number is precisely $n=15$, and in no case 16.

Task No. 5. In arithmetic progression $(()_(5))=-150,(()_(6))=-147$. Find the number of the first positive term of this progression.

This would be exactly the same problem as the previous one, but we do not know $((a)_(1))$. But the neighboring terms are known: $((a)_(5))$ and $((a)_(6))$, so we can easily find the difference of the progression:

In addition, let's try to express the fifth term through the first and the difference using the standard formula:

\[\begin(align) & ((a)_(n))=((a)_(1))+\left(n-1 \right)\cdot d; \\ & ((a)_(5))=((a)_(1))+4d; \\ & -150=((a)_(1))+4\cdot 3; \\ & ((a)_(1))=-150-12=-162. \\ \end(align)\]

Now we proceed by analogy with the previous task. Let's find out at what point in our sequence positive numbers will appear:

\[\begin(align) & ((a)_(n))=-162+\left(n-1 \right)\cdot 3 \gt 0; \\ & -162+3n-3 \gt 0; \\ & 3n \gt 165; \\ & n \gt 55\Rightarrow ((n)_(\min ))=56. \\ \end(align)\]

The minimum integer solution to this inequality is the number 56.

Please note: in the last task everything came down to strict inequality, so the option $n=55$ will not suit us.

Now that we have learned how to solve simple problems, let's move on to more complex ones. But first, let's study another very useful property of arithmetic progressions, which will save us a lot of time and unequal cells in the future. :)

Arithmetic mean and equal indentations

Let's consider several consecutive terms of the increasing arithmetic progression $\left(((a)_(n)) \right)$. Let's try to mark them on the number line:

Terms of an arithmetic progression on the number line

I specifically marked arbitrary terms $((a)_(n-3)),...,((a)_(n+3))$, and not some $((a)_(1)) ,\ ((a)_(2)),\ ((a)_(3))$, etc. Because the rule that I’ll tell you about now works the same for any “segments”.

And the rule is very simple. Let's remember the recurrent formula and write it for all marked terms:

\[\begin(align) & ((a)_(n-2))=((a)_(n-3))+d; \\ & ((a)_(n-1))=((a)_(n-2))+d; \\ & ((a)_(n))=((a)_(n-1))+d; \\ & ((a)_(n+1))=((a)_(n))+d; \\ & ((a)_(n+2))=((a)_(n+1))+d; \\ \end(align)\]

However, these equalities can be rewritten differently:

\[\begin(align) & ((a)_(n-1))=((a)_(n))-d; \\ & ((a)_(n-2))=((a)_(n))-2d; \\ & ((a)_(n-3))=((a)_(n))-3d; \\ & ((a)_(n+1))=((a)_(n))+d; \\ & ((a)_(n+2))=((a)_(n))+2d; \\ & ((a)_(n+3))=((a)_(n))+3d; \\ \end(align)\]

Well, so what? And the fact that the terms $((a)_(n-1))$ and $((a)_(n+1))$ lie at the same distance from $((a)_(n)) $. And this distance is equal to $d$. The same can be said about the terms $((a)_(n-2))$ and $((a)_(n+2))$ - they are also removed from $((a)_(n))$ at the same distance equal to $2d$. We can continue ad infinitum, but the meaning is well illustrated by the picture

The terms of the progression lie at the same distance from the center

What does this mean for us? This means that $((a)_(n))$ can be found if the neighboring numbers are known:

\[((a)_(n))=\frac(((a)_(n-1))+((a)_(n+1)))(2)\]

We have derived an excellent statement: every term of an arithmetic progression is equal to the arithmetic mean of its neighboring terms! Moreover: we can step back from our $((a)_(n))$ to the left and to the right not by one step, but by $k$ steps - and the formula will still be correct:

\[((a)_(n))=\frac(((a)_(n-k))+((a)_(n+k)))(2)\]

Those. we can easily find some $((a)_(150))$ if we know $((a)_(100))$ and $((a)_(200))$, because $(( a)_(150))=\frac(((a)_(100))+((a)_(200)))(2)$. At first glance, it may seem that this fact does not give us anything useful. However, in practice, many problems are specially tailored to use the arithmetic mean. Take a look:

Task No. 6. Find all values ​​of $x$ for which the numbers $-6((x)^(2))$, $x+1$ and $14+4((x)^(2))$ are consecutive terms of an arithmetic progression (in in the order indicated).

Solution. Since these numbers are members of a progression, the arithmetic mean condition is satisfied for them: the central element $x+1$ can be expressed in terms of neighboring elements:

\[\begin(align) & x+1=\frac(-6((x)^(2))+14+4((x)^(2)))(2); \\ & x+1=\frac(14-2((x)^(2)))(2); \\ & x+1=7-((x)^(2)); \\ & ((x)^(2))+x-6=0. \\ \end(align)\]

The result is a classic quadratic equation. Its roots: $x=2$ and $x=-3$ are the answers.

Answer: −3; 2.

Task No. 7. Find the values ​​of $$ for which the numbers $-1;4-3;(()^(2))+1$ form an arithmetic progression (in that order).

Solution. Let us again express the middle term through the arithmetic mean of neighboring terms:

\[\begin(align) & 4x-3=\frac(x-1+((x)^(2))+1)(2); \\ & 4x-3=\frac(((x)^(2))+x)(2);\quad \left| \cdot 2 \right.; \\ & 8x-6=((x)^(2))+x; \\ & ((x)^(2))-7x+6=0. \\ \end(align)\]

Quadratic equation again. And again there are two roots: $x=6$ and $x=1$.

Answer: 1; 6.

If in the process of solving a problem you come up with some brutal numbers, or you are not entirely sure of the correctness of the answers found, then there is a wonderful technique that allows you to check: have we solved the problem correctly?

Let's say in problem No. 6 we received answers −3 and 2. How can we check that these answers are correct? Let's just plug them into the original condition and see what happens. Let me remind you that we have three numbers ($-6(()^(2))$, $+1$ and $14+4(()^(2))$), which must form an arithmetic progression. Let's substitute $x=-3$:

\[\begin(align) & x=-3\Rightarrow \\ & -6((x)^(2))=-54; \\ & x+1=-2; \\ & 14+4((x)^(2))=50. \end(align)\]

We got the numbers −54; −2; 50 that differ by 52 is undoubtedly an arithmetic progression. The same thing happens for $x=2$:

\[\begin(align) & x=2\Rightarrow \\ & -6((x)^(2))=-24; \\ & x+1=3; \\ & 14+4((x)^(2))=30. \end(align)\]

Again a progression, but with a difference of 27. Thus, the problem was solved correctly. Those who wish can check the second problem on their own, but I’ll say right away: everything is correct there too.

In general, while solving the last problems, we came across another interesting fact that also needs to be remembered:

If three numbers are such that the second is the arithmetic mean of the first and last, then these numbers form an arithmetic progression.

In the future, understanding this statement will allow us to literally “construct” the necessary progressions based on the conditions of the problem. But before we engage in such “construction”, we should pay attention to one more fact, which directly follows from what has already been discussed.

Grouping and summing elements

Let's return to the number axis again. Let us note there several members of the progression, between which, perhaps. is worth a lot of other members:

There are 6 elements marked on the number line

Let's try to express the “left tail” through $((a)_(n))$ and $d$, and the “right tail” through $((a)_(k))$ and $d$. It's very simple:

\[\begin(align) & ((a)_(n+1))=((a)_(n))+d; \\ & ((a)_(n+2))=((a)_(n))+2d; \\ & ((a)_(k-1))=((a)_(k))-d; \\ & ((a)_(k-2))=((a)_(k))-2d. \\ \end(align)\]

Now note that the following amounts are equal:

\[\begin(align) & ((a)_(n))+((a)_(k))=S; \\ & ((a)_(n+1))+((a)_(k-1))=((a)_(n))+d+((a)_(k))-d= S; \\ & ((a)_(n+2))+((a)_(k-2))=((a)_(n))+2d+((a)_(k))-2d= S. \end(align)\]

Simply put, if we consider as a start two elements of the progression, which in total are equal to some number $S$, and then begin to step from these elements in opposite directions (toward each other or vice versa to move away), then the sums of the elements that we will stumble upon will also be equal$S$. This can be most clearly represented graphically:

Equal indentations give equal amounts

Understanding this fact will allow us to solve problems of a fundamentally higher level of complexity than those we considered above. For example, these:

Task No. 8. Determine the difference of an arithmetic progression in which the first term is 66, and the product of the second and twelfth terms is the smallest possible.

Solution. Let's write down everything we know:

\[\begin(align) & ((a)_(1))=66; \\&d=? \\ & ((a)_(2))\cdot ((a)_(12))=\min . \end(align)\]

So, we do not know the progression difference $d$. Actually, the entire solution will be built around the difference, since the product $((a)_(2))\cdot ((a)_(12))$ can be rewritten as follows:

\[\begin(align) & ((a)_(2))=((a)_(1))+d=66+d; \\ & ((a)_(12))=((a)_(1))+11d=66+11d; \\ & ((a)_(2))\cdot ((a)_(12))=\left(66+d \right)\cdot \left(66+11d \right)= \\ & =11 \cdot \left(d+66 \right)\cdot \left(d+6 \right). \end(align)\]

For those in the tank: I took the total multiplier of 11 out of the second bracket. Thus, the desired product is a quadratic function with respect to the variable $d$. Therefore, consider the function $f\left(d \right)=11\left(d+66 \right)\left(d+6 \right)$ - its graph will be a parabola with branches up, because if we expand the brackets, we get:

\[\begin(align) & f\left(d \right)=11\left(((d)^(2))+66d+6d+66\cdot 6 \right)= \\ & =11(( d)^(2))+11\cdot 72d+11\cdot 66\cdot 6 \end(align)\]

As you can see, the coefficient of the highest term is 11 - this is a positive number, so we are really dealing with a parabola with upward branches:

graph of a quadratic function - parabola

Please note: this parabola takes its minimum value at its vertex with the abscissa $((d)_(0))$. Of course, we can calculate this abscissa using the standard scheme (there is the formula $((d)_(0))=(-b)/(2a)\;$), but it would be much more reasonable to note that the desired vertex lies on the axis symmetry of the parabola, therefore the point $((d)_(0))$ is equidistant from the roots of the equation $f\left(d \right)=0$:

\[\begin(align) & f\left(d \right)=0; \\ & 11\cdot \left(d+66 \right)\cdot \left(d+6 \right)=0; \\ & ((d)_(1))=-66;\quad ((d)_(2))=-6. \\ \end(align)\]

That is why I was in no particular hurry to open the brackets: in their original form, the roots were very, very easy to find. Therefore, the abscissa is equal to the arithmetic mean of the numbers −66 and −6:

\[((d)_(0))=\frac(-66-6)(2)=-36\]

What does the discovered number give us? With it, the required product takes on the smallest value (by the way, we never calculated $((y)_(\min ))$ - this is not required of us). At the same time, this number is the difference from the original progression, i.e. we found the answer. :)

Answer: −36

Task No. 9. Between the numbers $-\frac(1)(2)$ and $-\frac(1)(6)$ insert three numbers so that together with these numbers they form an arithmetic progression.

Solution. Essentially, we need to make a sequence of five numbers, with the first and last number already known. Let's denote the missing numbers by the variables $x$, $y$ and $z$:

\[\left(((a)_(n)) \right)=\left\( -\frac(1)(2);x;y;z;-\frac(1)(6) \right\ )\]

Note that the number $y$ is the “middle” of our sequence - it is equidistant from the numbers $x$ and $z$, and from the numbers $-\frac(1)(2)$ and $-\frac(1)( 6)$. And if we currently cannot obtain $y$ from the numbers $x$ and $z$, then the situation is different with the ends of the progression. Let's remember the arithmetic mean:

Now, knowing $y$, we will find the remaining numbers. Note that $x$ lies between the numbers $-\frac(1)(2)$ and the $y=-\frac(1)(3)$ we just found. That's why

Using similar reasoning, we find the remaining number:

Ready! We found all three numbers. Let's write them in the answer in the order in which they should be inserted between the original numbers.

Answer: $-\frac(5)(12);\ -\frac(1)(3);\ -\frac(1)(4)$

Task No. 10. Between the numbers 2 and 42, insert several numbers that, together with these numbers, form an arithmetic progression, if you know that the sum of the first, second and last of the inserted numbers is 56.

Solution. An even more complex problem, which, however, is solved according to the same scheme as the previous ones - through the arithmetic mean. The problem is that we don’t know exactly how many numbers need to be inserted. Therefore, let us assume for definiteness that after inserting everything there will be exactly $n$ numbers, and the first of them is 2, and the last is 42. In this case, the required arithmetic progression can be represented in the form:

\[\left(((a)_(n)) \right)=\left\( 2;((a)_(2));((a)_(3));...;(( a)_(n-1));42 \right\)\]

\[((a)_(2))+((a)_(3))+((a)_(n-1))=56\]

Note, however, that the numbers $((a)_(2))$ and $((a)_(n-1))$ are obtained from the numbers 2 and 42 at the edges by one step towards each other, i.e. . to the center of the sequence. And this means that

\[((a)_(2))+((a)_(n-1))=2+42=44\]

But then the expression written above can be rewritten as follows:

\[\begin(align) & ((a)_(2))+((a)_(3))+((a)_(n-1))=56; \\ & \left(((a)_(2))+((a)_(n-1)) \right)+((a)_(3))=56; \\ & 44+((a)_(3))=56; \\ & ((a)_(3))=56-44=12. \\ \end(align)\]

Knowing $((a)_(3))$ and $((a)_(1))$, we can easily find the difference of the progression:

\[\begin(align) & ((a)_(3))-((a)_(1))=12-2=10; \\ & ((a)_(3))-((a)_(1))=\left(3-1 \right)\cdot d=2d; \\ & 2d=10\Rightarrow d=5. \\ \end(align)\]

All that remains is to find the remaining terms:

\[\begin(align) & ((a)_(1))=2; \\ & ((a)_(2))=2+5=7; \\ & ((a)_(3))=12; \\ & ((a)_(4))=2+3\cdot 5=17; \\ & ((a)_(5))=2+4\cdot 5=22; \\ & ((a)_(6))=2+5\cdot 5=27; \\ & ((a)_(7))=2+6\cdot 5=32; \\ & ((a)_(8))=2+7\cdot 5=37; \\ & ((a)_(9))=2+8\cdot 5=42; \\ \end(align)\]

Thus, already at the 9th step we will arrive at the left end of the sequence - the number 42. In total, only 7 numbers had to be inserted: 7; 12; 17; 22; 27; 32; 37.

Answer: 7; 12; 17; 22; 27; 32; 37

Word problems with progressions

In conclusion, I would like to consider a couple of relatively simple problems. Well, as simple as that: for most students who study mathematics at school and have not read what is written above, these problems may seem tough. Nevertheless, these are the types of problems that appear in the OGE and the Unified State Exam in mathematics, so I recommend that you familiarize yourself with them.

Task No. 11. The team produced 62 parts in January, and in each subsequent month they produced 14 more parts than in the previous month. How many parts did the team produce in November?

Solution. Obviously, the number of parts listed by month will represent an increasing arithmetic progression. Moreover:

\[\begin(align) & ((a)_(1))=62;\quad d=14; \\ & ((a)_(n))=62+\left(n-1 \right)\cdot 14. \\ \end(align)\]

November is the 11th month of the year, so we need to find $((a)_(11))$:

\[((a)_(11))=62+10\cdot 14=202\]

Therefore, 202 parts will be produced in November.

Task No. 12. The bookbinding workshop bound 216 books in January, and in each subsequent month it bound 4 more books than in the previous month. How many books did the workshop bind in December?

Solution. All the same:

$\begin(align) & ((a)_(1))=216;\quad d=4; \\ & ((a)_(n))=216+\left(n-1 \right)\cdot 4. \\ \end(align)$

December is the last, 12th month of the year, so we are looking for $((a)_(12))$:

\[((a)_(12))=216+11\cdot 4=260\]

This is the answer - 260 books will be bound in December.

Well, if you have read this far, I hasten to congratulate you: you have successfully completed the “young fighter’s course” in arithmetic progressions. You can safely move on to the next lesson, where we will study the formula for the sum of progression, as well as important and very useful consequences from it.

When studying algebra in a secondary school (9th grade), one of the important topics is the study of numerical sequences, which include progressions - geometric and arithmetic. In this article we will look at an arithmetic progression and examples with solutions.

What is an arithmetic progression?

To understand this, it is necessary to define the progression in question, as well as provide the basic formulas that will be used later in solving problems.

An arithmetic or algebraic progression is a set of ordered rational numbers, each term of which differs from the previous one by some constant value. This value is called the difference. That is, knowing any member of an ordered series of numbers and the difference, you can restore the entire arithmetic progression.

Let's give an example. The following sequence of numbers will be an arithmetic progression: 4, 8, 12, 16, ..., since the difference in this case is 4 (8 - 4 = 12 - 8 = 16 - 12). But the set of numbers 3, 5, 8, 12, 17 can no longer be attributed to the type of progression under consideration, since the difference for it is not a constant value (5 - 3 ≠ 8 - 5 ≠ 12 - 8 ≠ 17 - 12).

Important Formulas

Let us now present the basic formulas that will be needed to solve problems using arithmetic progression. Let us denote by the symbol a n the nth member of the sequence, where n is an integer. We denote the difference by the Latin letter d. Then the following expressions are valid:

1. To determine the value of the nth term, the following formula is suitable: a n = (n-1)*d+a 1 .
2. To determine the sum of the first n terms: S n = (a n +a 1)*n/2.

To understand any examples of arithmetic progression with solutions in 9th grade, it is enough to remember these two formulas, since any problems of the type under consideration are based on their use. You should also remember that the progression difference is determined by the formula: d = a n - a n-1.

Example #1: finding an unknown member

Let's give a simple example of an arithmetic progression and the formulas that need to be used to solve it.

Let the sequence 10, 8, 6, 4, ... be given, you need to find five terms in it.

From the conditions of the problem it already follows that the first 4 terms are known. The fifth can be defined in two ways:

1. Let's first calculate the difference. We have: d = 8 - 10 = -2. Similarly, one could take any two other members standing next to each other. For example, d = 4 - 6 = -2. Since it is known that d = a n - a n-1, then d = a 5 - a 4, from which we get: a 5 = a 4 + d. We substitute the known values: a 5 = 4 + (-2) = 2.
2. The second method also requires knowledge of the difference of the progression in question, so you first need to determine it as shown above (d = -2). Knowing that the first term a 1 = 10, we use the formula for the n number of the sequence. We have: a n = (n - 1) * d + a 1 = (n - 1) * (-2) + 10 = 12 - 2*n. Substituting n = 5 into the last expression, we get: a 5 = 12-2 * 5 = 2.

As you can see, both solutions led to the same result. Note that in this example the progression difference d is a negative value. Such sequences are called decreasing, since each next term is less than the previous one.

Example #2: progression difference

Now let’s complicate the task a little, let’s give an example of how

It is known that in some the 1st term is equal to 6, and the 7th term is equal to 18. It is necessary to find the difference and restore this sequence to the 7th term.

Let's use the formula to determine the unknown term: a n = (n - 1) * d + a 1 . Let's substitute the known data from the condition into it, that is, the numbers a 1 and a 7, we have: 18 = 6 + 6 * d. From this expression you can easily calculate the difference: d = (18 - 6) /6 = 2. Thus, we have answered the first part of the problem.

To restore the sequence to the 7th term, you should use the definition of an algebraic progression, that is, a 2 = a 1 + d, a 3 = a 2 + d, and so on. As a result, we restore the entire sequence: a 1 = 6, a 2 = 6 + 2=8, a 3 = 8 + 2 = 10, a 4 = 10 + 2 = 12, a 5 = 12 + 2 = 14, a 6 = 14 + 2 = 16, a 7 = 18.

Example No. 3: drawing up a progression

Let's complicate the problem even more. Now we need to answer the question of how to find an arithmetic progression. The following example can be given: two numbers are given, for example - 4 and 5. It is necessary to create an algebraic progression so that three more terms are placed between these.

Before you start solving this problem, you need to understand what place the given numbers will occupy in the future progression. Since there will be three more terms between them, then a 1 = -4 and a 5 = 5. Having established this, we move on to the problem, which is similar to the previous one. Again, for the nth term we use the formula, we get: a 5 = a 1 + 4 * d. From: d = (a 5 - a 1)/4 = (5 - (-4)) / 4 = 2.25. What we got here is not an integer value of the difference, but it is a rational number, so the formulas for the algebraic progression remain the same.

Now let's add the found difference to a 1 and restore the missing terms of the progression. We get: a 1 = - 4, a 2 = - 4 + 2.25 = - 1.75, a 3 = -1.75 + 2.25 = 0.5, a 4 = 0.5 + 2.25 = 2.75, a 5 = 2.75 + 2.25 = 5, which coincided with the conditions of the problem.

Example No. 4: first term of progression

Let's continue to give examples of arithmetic progression with solutions. In all previous problems, the first number of the algebraic progression was known. Now let's consider a problem of a different type: let two numbers be given, where a 15 = 50 and a 43 = 37. It is necessary to find which number this sequence begins with.

The formulas used so far assume knowledge of a 1 and d. In the problem statement, nothing is known about these numbers. Nevertheless, we will write down expressions for each term about which information is available: a 15 = a 1 + 14 * d and a 43 = a 1 + 42 * d. We received two equations in which there are 2 unknown quantities (a 1 and d). This means that the problem is reduced to solving a system of linear equations.

The easiest way to solve this system is to express a 1 in each equation and then compare the resulting expressions. First equation: a 1 = a 15 - 14 * d = 50 - 14 * d; second equation: a 1 = a 43 - 42 * d = 37 - 42 * d. Equating these expressions, we get: 50 - 14 * d = 37 - 42 * d, whence the difference d = (37 - 50) / (42 - 14) = - 0.464 (only 3 decimal places are given).

Knowing d, you can use any of the 2 expressions above for a 1. For example, first: a 1 = 50 - 14 * d = 50 - 14 * (- 0.464) = 56.496.

If you have doubts about the result obtained, you can check it, for example, determine the 43rd term of the progression, which is specified in the condition. We get: a 43 = a 1 + 42 * d = 56.496 + 42 * (- 0.464) = 37.008. The small error is due to the fact that rounding to thousandths was used in the calculations.

Example No. 5: amount

Now let's look at several examples with solutions for the sum of an arithmetic progression.

Let a numerical progression of the following form be given: 1, 2, 3, 4, ...,. How to calculate the sum of 100 of these numbers?

Thanks to the development of computer technology, it is possible to solve this problem, that is, add all the numbers sequentially, which the computer will do as soon as a person presses the Enter key. However, the problem can be solved mentally if you pay attention that the presented series of numbers is an algebraic progression, and its difference is equal to 1. Applying the formula for the sum, we get: S n = n * (a 1 + a n) / 2 = 100 * (1 + 100) / 2 = 5050.

It is interesting to note that this problem is called “Gaussian” because at the beginning of the 18th century the famous German, still only 10 years old, was able to solve it in his head in a few seconds. The boy did not know the formula for the sum of an algebraic progression, but he noticed that if you add the numbers at the ends of the sequence in pairs, you always get the same result, that is, 1 + 100 = 2 + 99 = 3 + 98 = ..., and since these sums will be exactly 50 (100 / 2), then to get the correct answer it is enough to multiply 50 by 101.

Example No. 6: sum of terms from n to m

Another typical example of the sum of an arithmetic progression is the following: given a series of numbers: 3, 7, 11, 15, ..., you need to find what the sum of its terms from 8 to 14 will be equal to.

The problem is solved in two ways. The first of them involves finding unknown terms from 8 to 14, and then summing them sequentially. Since there are few terms, this method is not quite labor-intensive. Nevertheless, it is proposed to solve this problem using a second method, which is more universal.

The idea is to obtain a formula for the sum of the algebraic progression between terms m and n, where n > m are integers. For both cases, we write two expressions for the sum:

1. S m = m * (a m + a 1) / 2.
2. S n = n * (a n + a 1) / 2.

Since n > m, it is obvious that the 2nd sum includes the first. The last conclusion means that if we take the difference between these sums and add the term a m to it (in the case of taking the difference, it is subtracted from the sum S n), we will obtain the necessary answer to the problem. We have: S mn = S n - S m + a m =n * (a 1 + a n) / 2 - m *(a 1 + a m)/2 + a m = a 1 * (n - m) / 2 + a n * n/2 + a m * (1- m/2). It is necessary to substitute formulas for a n and a m into this expression. Then we get: S mn = a 1 * (n - m) / 2 + n * (a 1 + (n - 1) * d) / 2 + (a 1 + (m - 1) * d) * (1 - m / 2) = a 1 * (n - m + 1) + d * n * (n - 1) / 2 + d *(3 * m - m 2 - 2) / 2.

The resulting formula is somewhat cumbersome, however, the sum S mn depends only on n, m, a 1 and d. In our case, a 1 = 3, d = 4, n = 14, m = 8. Substituting these numbers, we get: S mn = 301.

As can be seen from the above solutions, all problems are based on knowledge of the expression for the nth term and the formula for the sum of the set of first terms. Before starting to solve any of these problems, it is recommended that you carefully read the condition, clearly understand what you need to find, and only then proceed with the solution.

Another tip is to strive for simplicity, that is, if you can answer a question without using complex mathematical calculations, then you need to do just that, since in this case the likelihood of making a mistake is less. For example, in the example of an arithmetic progression with solution No. 6, one could stop at the formula S mn = n * (a 1 + a n) / 2 - m * (a 1 + a m) / 2 + a m, and divide the overall problem into separate subtasks (in this case, first find the terms a n and a m).

If you have doubts about the result obtained, it is recommended to check it, as was done in some of the examples given. We found out how to find an arithmetic progression. If you figure it out, it's not that difficult.