Criterio de Leibniz
Ejemplos
Lecciones
¡Únete Gratis!
Observa tu Progreso Facilmente
Registramos tu progreso en cada tema para que sepas lo que has logrado. Desde el índice del curso, puede ver fácilmente el contenido de cada tema y el progreso que has realizado en ellos. Llena los anillos para dominar por completo esa sección o coloca el mouse sobre el ícono para ver más detalles.Utiliza Nuestras Ayudas de Aprendizaje
Obtén Logros a Medida que Aprendes.
Aprovecha al máximo tu tiempo en StudyPug para ayudarte a lograr tus objetivos. Gana pequeñas y divertidas insignias en cuanto más mires, practiques y uses nuestro servicio.Crea y Personaliza tu Avatar
Juega con nuestro pequeño y divertido creador de avatares para crear y personalizar tu propio avatar en StudyPug. Elige tu cara, color de ojos, color y estilo de cabello y fondo. Desbloquea más opciones cuanto más uses StudyPug.
Notas del Tema
Alternating Series Test
The alternating series test (also known as the Leibniz test), is type of series test used to determine the convergence of series that alternate. Keep in mind that the test does not tell whether the series diverges. In order to use this test, we first need to know what a converging series and a diverging series is.
What is a convergent series? What is a divergent series?
A convergent series is an infinite series which sums up to a finite number. For example, the famous convergent series:
This convergent series sum up to $\frac{\pi^{2}}{6}$! How do you get that? It is a long process that requires a lot of calculations, but usually it is sufficient enough to know that the series is convergent by the pseries test.
A divergent series is an infinite series where the sum is infinity. For example, the series
Adding up all the numbers will give you a sum of infinity. If that doesn't convince you, take a look at this. Note that the series could be written as an $N^{th}$ partial sum.
Now if we were to make it an infinite series, then we are going to take the limit as N goes to infinity of both sides. In other words,
Now that we know what a divergent and convergent series is, let's take a look at the alternating series test.
Alternating Series Test
In order to use the alternating series test, the series must be alternating. In other words, the series are in the form:
or
where $b_{n} \leq 0$. An alternating series is not limited to these two forms because the exponent on the (1) can vary. Now the alternating series test states that if the two following conditions are met, then the alternating series is convergent:
For the second condition, $b_{n}$ does not have to be strictly decreasing for all $n \leq 1$. As long as the sequence is decreasing at $n$→$\infty$, then that will be sufficient enough to show that it is decreasing. Now that we know what the alternating series test is, let us put it to use for the following examples.
Example 1: Show that the series
is convergent.
Before we want to use the alternating series test, we want to make sure that the series is actually alternating. In other words, turn this series into the form:
As you can see, we can turn our series into that form. Notice that:
And so we know that:
Hence, we can go ahead and use the alternating series test. Now remember the two conditions. First we have to show that
Since our $b_{n} = \frac{1}{n^{2}}$, then our limit is
Notice that this limit does to 0, hence
and so our first condition is fulfilled. Now let's take a look at the second condition. We have to make sure that $\frac{1}{n^{2}}$ is decreasing. How do we do this? There are a total of three ways to do this:

Method 1:
Write out the first few terms We can write out the first few terms of $b_{n}$ and then conclude if the sequence is decreasing. Notice that: 
Method 2:
Compare the $n^{th}$ term and $(n+1)^{th}$ term of the sequence $b_{n}$.
Notice that the $n^{th}$ term of the sequence $b_{n}$ is:
And the $(n+1)^{th}$ term is
Now comparing the two terms, you should notice that:
The left side is bigger than the right side because the denominator in the right side is bigger, hence the term is actually smaller. So we just concluded that:
for all $n$>1. This means that the $n^{th}$ term is always going to be bigger than the $(n+1)^{th}$ term, which means the sequence is always decreasing. Hence again, the second condition is fulfilled. Again, sometimes it's really hard to compare the two terms. In this case, look at method 3.

Method 3:
Take the derivative
What were going to do is take the general term ($b_{n}$) and change all the $n$'s to $x$'s, and set it as $f(x)$. In other words,
Now we are going to take the derivative of this function. This will give us:
Notice that for $x$ > 0, the denominator is going to be positive, and so the derivative f'(x) is negative. In other words, for increasing value of $x$, the function is decreasing. Now let's put that into the perspective of $b_{n}$. This means that for increasing values of n, the sequence $b_{n}$ is always decreasing. Thus, we just fulfilled the second condition again.
Since the two conditions are fulfilled, then we can conclude that the series
converges. Now let's take a look at a more interesting alternating series.
Example 2: Consider the alternating harmonic series:
Is it convergent? If it is, then what is the sum of this series?
 What should we do here? You are probably thinking about one of the series convergence tests. You are most likely thinking about using the alternating series test. Again, we need to show that this is in fact an alternating series before we can apply the alternating series test. Recall that an alternating series could be of the form:
 Notice that:
 And so we know that
 Since we know that it is an alternating series, then we can see if the two conditions are fulfilled. For the first condition, we see that:
 So the first condition is fulfilled. Now the second condition states that $b_{n}$ must be a decreasing sequence. Feel free to use any of the methods, but I will be using method two. See that the $n^{th}$ term and $(n+1)^{th}$ term are
 Notice by comparing $n^{th}$ term and $(n+1)^{th}$ term of the sequence, we have:
 Again, this is because the denominator on the right side is bigger, so the term is actually smaller. In other words, we just concluded that:
 For $n$>1. Hence, every term after is smaller than the one before it. So we can conclude that the sequence is decreasing. Since both of the conditions are fulfilled, then the series is convergent. But what is the sum of the series? Fortunately, there is an easy way to find this. First, we must recognize the Maclaurin series:
 Now if we were to set $x$ = 1, then we will see that
 In other words, we just concluded that:
So the sum of this alternating harmonic series is ln(2). If you want to take a look at more examples of using the alternating series test, click on this link.
http://tutorial.math.lamar.edu/Classes/CalcII/AlternatingSeries.aspxNow here is an interesting question. If the alternating harmonic series is convergent, then what about the harmonic series itself? Is
convergent or divergent? You may realize that this isn't an alternating series, so we are going to have to use another test. Why don't we use the $n^{th}$ term test?
nth term test for divergence
Recall that the nth term test (also known as the divergence test) states the following:
So if we take the limit and it is anything BUT 0, then we can say that the series diverge. However, if it does equal 0, then it does NOT mean the series converge. It just means the test has failed, and you would have to use something else to test the convergence.
Now using this test for the harmonic series we let:
Then you will see that:
Since we've got 0, then the nth term test has failed and we would have to try something else. This leads to the question, maybe the harmonic series really converges?
Does 1/n converge
Let us assume that the harmonic series is convergent. Then that means the series must sum up to a finite number. Let's call that sum S. So
Now we are going to play a little trick here. We can say that:
However on the right hand side of the inequality, see that
In other words, we are saying that
This is impossible, so we reached a contradiction. This situation causes us to get a mathematically illogical statement, so then the harmonic series must be divergent. A lot of people get confused by this method, so I have prepared another easier method to show that the harmonic series diverges. This method will require you to know the pseries rules.
Recall that pseries are in the form:
The pseries rule (or pseries test) states that if p>1, then the series converge. Otherwise, the series diverge. Notice that the series that we have is very similar to it.
In fact, our p=1 in this case. We also know that p=1$\ngtr$1, so then we know that the series diverge. Now we kind of went off topic here, but you must have realized that removing the $(1)^{(n+1)}$ from the series can actually change the convergence or divergence of a series.
Alternating Series Estimation Theorem
So we learned that it is possible to find the sum of an alternating harmonic series using a complicated formula that we were unfamiliar with. But what if we are dealing with another alternating series? How would we find the sum? Unfortunately there is no good way to find the exact sum of converging alternating series, but there is a way to estimate the sum. It is called the alternating series estimation theorem.
The alternating series estimation theorem states the following:
Suppose that the alternating series
Is convergent and converges to a finite number $S$. Then
where:
$S_{n}$ = the partial sum of n terms (sum of the first n terms)
$R_{n}$ = the remainder (or error term) that we get from subtracting the actual value of the series with the sum of the first n terms. Sometimes it's called the alternating series error.
$b_{n+1}$ = the neglected term.
Note that this theorem only works if the series is alternating. You are probably very confused at what this theorem is saying, so let us use a series as an example.
Example 3: Let's take a look at the alternating harmonic series we used earlier:
 Let's expand the series out. Doing so will give us:
 Now let's say that we want to estimate the sum of this series. What I'm going to do is estimate the sum of the series by summing the first 4 terms. Summing the first 4 terms gives us:
 Since we only look at the first 4 terms, then the next term after it (the $5^{th}$ term) is the neglected term. Recall that the series can be rewritten as
 So $b_{n} = \frac{1}{n}$, and hence
 Now what the theorem says is that
 So using the 2 pieces of information that we have, then
 Our remainder is kind of in the way of our equation, so we can get rid of it and have
 Now instead of having the absolute value, we can rewrite our inequality to be:
 Adding 0.58333 to all sides of the inequality gives us:
 Hence, we just estimate what the sum of the series is! It must be between 0.38333 and 0.78333. Note that you can also do this by summing the first 5 term or the first 11 terms. Usually the questions you will be dealing with will tell you how many terms you need to sum. In fact, as you sum more and more terms and use this theorem, your estimation becomes more and more accurate.
Now let's take a look at a question where we don't know how many terms we need to sum, but we know that our remainder (or error) has to be less than a certain number.
Example 4: Determine the number of terms required to approximate the sum of the series
with an error of less than 0.0001.
 Recall that the theorem states that:
 If the error must be less than 0.0001, then basically we are saying that
 or in a more simple manner,
 Now we can't really do anything with this inequality because there are too many unknowns. So we need to think of a better way to do this. This is where it gets a little tricky because we actually have to think about this.
 Instead of saying that 0.0001 is less than the neglected term $(0.0001 \leq b_{n+1})$, why don't we say that the neglected term is less than 0.0001. In other words, let's say that
 Why? Think about it. We know that
 The error term is less than the neglected term. So if the neglected term is less than 0.0001, then it must be true that the error term is less than 0.0001. Basically we are saying that:
 So this works! Now going back to our inequality
 We know that
 So
 That means
 We can rewrite this inequality to be:

That means as long as $n$ > 9999, then the error (or remainder) will be less than 0.0001. Let's pick $n$=10000. This means that summing the first 10000 terms will guarantee the error to be less than 0.0001. That is a lot of terms to sum up! If you want to look at more examples, then take a look at this link:
http://mathonline.wikidot.com/errorestimationforapproximatingalternatingseries
Donde $b^n \geq0$
Cabe recalcar que las series alternadas no están limitadas a estas dos formas solamente, ya que el exponente en el (1) varía y con ello la manera en la cual se ven estas series.
La prueba de la serie alternada, también llamado el Criterio de Leibniz dice que si las siguientes dos condiciones se cumplen, entonces la serie alternada es convergente.
 $\lim$_{n →$\infty$} $b_n=0$
 La secuencia $b_n$ es una secuencia decreciente.
Para la segunda condición, $b_n$ no tiene que ser decreciente estrictamente para todas las $n\geq 1$. Mientras la secuencia sea decreciente para $n$→$\infty$, es suficiente.
Restantes Hoy
Restantes Hoy