Write the first five terms of the sequence defined recursively. Use the pattern to write the nth term of the sequence as a function of n. (Assume that n begins with 1.)
a (subtext) 1 =4,a (subtext) (k+1) =−a (subtext) k
a. a (subtext) n =4(−1)^n−1
b. a (subtext) n =4n
c. a (subtext) n =(−4)^n−1
d. a (subtext) n =(−4)^n
e. a (subtext) n =4(−1)^n
1 answer
since you keep multiplying by -1, there will be (n-1) of them by the nth term.