It can be written recursively as follows:
U1 = 1
U2 = 6
U3 = 4
Un = Un-1 + Un-2 - Un-3 for n ≥ 4
no it is not a recursive pattern because it isn't equal numbers.
Yea
Yes
5509.
1) Recursive algorithms 2) Basic Principle 3) Analysis
no it is not a recursive pattern because it isn't equal numbers.
Yes. Each term is 10 more than the previous term.
Yes. One possible description is Un+1 = 10*Un + 1.
a recursive pattern is when you always use the next term in the pattern... for example 4,(x2+1) 9,(x2+1) 19,(x2+1) 39,(x2+1) 79,(x2+1) 159
Yea
Yes
5509.
t(1) = 3 t(n) = t(n-1) + 2(n-2) for n = 2, 3, 4, ...
The numbers are increasing by 10, then 9. 1 + 10 = 11, 11 + 9 = 20, and so on.
1) Recursive algorithms 2) Basic Principle 3) Analysis
t(n+1) = t(n) + 6 t(1) = -14
Yes. The next two numbers would be 49 & 58. This is because, from the first number, the pattern repeats by adding 10 then 9. So - 39+19 is 49, and 49+9=58.