How to find the next term in an arithmetic sequence - GRE Quantitative Reasoning

For this problem, you definitely do not want to "count upwards" to the full value of the sequence. Therefore, the best approach is to consider the general pattern that arises from the general definition:

This means that for every element in the list, each one is greater than the one preceding it. For instance:

Now, notice that the first element is:

The second is:

The third could be represented as:

And so forth...

Now, notice that for the third element, there are only two instances of . We could rewrite our sequence:

This value will always "lag behind" by one. Therefore, for the st element, you will have:

For this problem, you definitely do not want to "count upwards" to the full value of the sequence. Therefore, the best approach is to consider the general pattern that arises from the general definition:

This means that for every element in the list, each one is less than the one preceding it. For instance:

Now, notice that the first element is:

The second is:

The third could be represented as:

And so forth...

Now, notice that for the third element, there are only two instances of . We could rewrite our sequence:

This value will always "lag behind" by one. Therefore, for the th element, you will have:

Begin by interpreting the general definition:

This means that every number in the sequence is five greater than the element preceding it. For instance:

It is easiest to count upwards:

For this problem, you definitely do not want to "count upwards" to the full value of the sequence. Therefore, the best approach is to consider the general pattern that arises from the general definition:

This means that for every element in the list, each one is greater than the one preceding it. For instance:

Now, notice that the first element is:

The second is:

The third could be represented as:

And so forth...

Now, notice that for the third element, there are only two instances of . We could rewrite our sequence:

This value will always "lag behind" by one. Therefore, for the st element, you will have:

For this problem, you definitely do not want to "count upwards" to the full value of the sequence. Therefore, the best approach is to consider the general pattern that arises from the general definition:

This means that for every element in the list, each one is less than the one preceding it. For instance:

Now, notice that the first element is:

The second is:

The third could be represented as:

And so forth...

Now, notice that for the third element, there are only two instances of . We could rewrite our sequence:

This value will always "lag behind" by one. Therefore, for the th element, you will have:

Begin by interpreting the general definition:

This means that every number in the sequence is five greater than the element preceding it. For instance:

It is easiest to count upwards:

For this problem, you definitely do not want to "count upwards" to the full value of the sequence. Therefore, the best approach is to consider the general pattern that arises from the general definition:

This means that for every element in the list, each one is greater than the one preceding it. For instance:

Now, notice that the first element is:

The second is:

The third could be represented as:

And so forth...

Now, notice that for the third element, there are only two instances of . We could rewrite our sequence:

This value will always "lag behind" by one. Therefore, for the st element, you will have:

For this problem, you definitely do not want to "count upwards" to the full value of the sequence. Therefore, the best approach is to consider the general pattern that arises from the general definition:

This means that for every element in the list, each one is less than the one preceding it. For instance:

Now, notice that the first element is:

The second is:

The third could be represented as:

And so forth...

Now, notice that for the third element, there are only two instances of . We could rewrite our sequence:

This value will always "lag behind" by one. Therefore, for the th element, you will have:

Begin by interpreting the general definition:

This means that every number in the sequence is five greater than the element preceding it. For instance:

It is easiest to count upwards:

For this problem, you definitely do not want to "count upwards" to the full value of the sequence. Therefore, the best approach is to consider the general pattern that arises from the general definition:

This means that for every element in the list, each one is greater than the one preceding it. For instance:

Now, notice that the first element is:

The second is:

The third could be represented as:

And so forth...

Now, notice that for the third element, there are only two instances of . We could rewrite our sequence:

This value will always "lag behind" by one. Therefore, for the st element, you will have:

For this problem, you definitely do not want to "count upwards" to the full value of the sequence. Therefore, the best approach is to consider the general pattern that arises from the general definition:

This means that for every element in the list, each one is less than the one preceding it. For instance:

Now, notice that the first element is:

The second is:

The third could be represented as:

And so forth...

Now, notice that for the third element, there are only two instances of . We could rewrite our sequence:

This value will always "lag behind" by one. Therefore, for the th element, you will have:

Begin by interpreting the general definition:

This means that every number in the sequence is five greater than the element preceding it. For instance:

It is easiest to count upwards:

For this problem, you definitely do not want to "count upwards" to the full value of the sequence. Therefore, the best approach is to consider the general pattern that arises from the general definition:

This means that for every element in the list, each one is greater than the one preceding it. For instance:

Now, notice that the first element is:

The second is:

The third could be represented as:

And so forth...

Now, notice that for the third element, there are only two instances of . We could rewrite our sequence:

This value will always "lag behind" by one. Therefore, for the st element, you will have:

For this problem, you definitely do not want to "count upwards" to the full value of the sequence. Therefore, the best approach is to consider the general pattern that arises from the general definition:

This means that for every element in the list, each one is less than the one preceding it. For instance:

Now, notice that the first element is:

The second is:

The third could be represented as:

And so forth...

Now, notice that for the third element, there are only two instances of . We could rewrite our sequence:

This value will always "lag behind" by one. Therefore, for the th element, you will have:

Begin by interpreting the general definition:

This means that every number in the sequence is five greater than the element preceding it. For instance:

It is easiest to count upwards:

For this problem, you definitely do not want to "count upwards" to the full value of the sequence. Therefore, the best approach is to consider the general pattern that arises from the general definition:

This means that for every element in the list, each one is greater than the one preceding it. For instance:

Now, notice that the first element is:

The second is:

The third could be represented as:

And so forth...

Now, notice that for the third element, there are only two instances of . We could rewrite our sequence:

This value will always "lag behind" by one. Therefore, for the st element, you will have:

For this problem, you definitely do not want to "count upwards" to the full value of the sequence. Therefore, the best approach is to consider the general pattern that arises from the general definition:

This means that for every element in the list, each one is less than the one preceding it. For instance:

Now, notice that the first element is:

The second is:

The third could be represented as:

And so forth...

Now, notice that for the third element, there are only two instances of . We could rewrite our sequence:

This value will always "lag behind" by one. Therefore, for the th element, you will have:

Begin by interpreting the general definition:

This means that every number in the sequence is five greater than the element preceding it. For instance:

It is easiest to count upwards:

For this problem, you definitely do not want to "count upwards" to the full value of the sequence. Therefore, the best approach is to consider the general pattern that arises from the general definition:

This means that for every element in the list, each one is greater than the one preceding it. For instance:

Now, notice that the first element is:

The second is:

The third could be represented as:

And so forth...

Now, notice that for the third element, there are only two instances of . We could rewrite our sequence:

This value will always "lag behind" by one. Therefore, for the st element, you will have: