Want this question answered?
It is often possible to find an explicit formula that gives the same answer as a given recursive formula - and vice versa. I don't think you can always find an explicit formula that gives the same answer.
what is the recursive formula for this geometric sequence?
an = a1 + d(n - 1)
You didn't say the series (I prefer to use the word sequence) of even numbers are consecutive even numbers, or even more generally an arithmetic sequence. If we are not given any information about the sequence other than that each member happens to be even, there is no formula for that other than the fact that you can factor out the 2 from each member and add up the halves, then multiply by 2: 2a + 2b + 2c = 2(a + b + c). If the even numbers are an arithmetic sequence, you can use the formula for the sum of an arithmetic sequence. Similarly if they are a geometric sequence.
The formula for the sum of an arithmetic sequence is ((first number) + (last number)) x (how many numbers) / 2, in this case, (1 + 100) x 100 / 2.The formula for the sum of an arithmetic sequence is ((first number) + (last number)) x (how many numbers) / 2, in this case, (1 + 100) x 100 / 2.The formula for the sum of an arithmetic sequence is ((first number) + (last number)) x (how many numbers) / 2, in this case, (1 + 100) x 100 / 2.The formula for the sum of an arithmetic sequence is ((first number) + (last number)) x (how many numbers) / 2, in this case, (1 + 100) x 100 / 2.
-7
The answer depends on what the explicit rule is!
It is often possible to find an explicit formula that gives the same answer as a given recursive formula - and vice versa. I don't think you can always find an explicit formula that gives the same answer.
what is the recursive formula for this geometric sequence?
a recursive formula is always based on a preceding value and uses A n-1 and the formula must have a start point (an A1) also known as a seed value. unlike recursion, explicit forms can stand alone and you can put any value into the "n" and one answer does not depend on the answer before it. we assume the "n" starts with 1 then 2 then 3 and so on arithmetic sequence: an = a1 + d(n-1) this does not depend on a previous value
arithmetic sequence * * * * * A recursive formula can produce arithmetic, geometric or other sequences. For example, for n = 1, 2, 3, ...: u0 = 2, un = un-1 + 5 is an arithmetic sequence. u0 = 2, un = un-1 * 5 is a geometric sequence. u0 = 0, un = un-1 + n is the sequence of triangular numbers. u0 = 0, un = un-1 + n(n+1)/2 is the sequence of perfect squares. u0 = 1, u1 = 1, un+1 = un-1 + un is the Fibonacci sequence.
In this case, 22 would have the value of 11.
Type yourWhich choice is the explicit formula for the following geometric sequence? answer here...
-7
In order to answer the question is is necessary to know what the explicit formula was. But, since you have not bothered to provide that information, the answer is .
12, 6, 0, -6, ...
4, -1236, -108 is not a geometric system.