A + 1 = 3000 a = ?

This is my first question, I know the answer. I just wanna test the platform.

Asequence {an} is defined recursively, with a1 = 1, a2 = 2 and, for n > 2, an = an-1 an-2 . find the term a241

What is best way to getting answer for my exam is

Zroms according to the synthetic division below, which of the following statements are true? check all that apply. 352 -2 6 -12 12 2 4 0 i a. (x-3) is a factor of 2x2 - 2x - 12. b. the number 3 is a root of f(x) = 2x2 - 2x - 12. c. (2x2 - 2x - 12) = (x + 3) = (2x + 4) d. (2x2 - 2x-12) - (x-3) = (2x + 4) e. (x+3) is a factor of 2x2 - 2x - 12. o f. the number -3 is a root of fx) = 2x2 - 2x - 12. previous