Given that the first term is LaTeX: t_1=2t 1 = 2, and the recursive definition is LaTeX: t_{n+1}=3^{\left(t_n\right)}t n + 1 = 3
( t n ), what would be the 2nd term (LaTeX: t_2t 2).
2 answers:
You might be interested in
Answer: OPTION C.
Step-by-step explanation:
1. To solve this problem you must apply the Pythagorean Theorem, which is shown below:
Where a is the hypotenuse, and b and c are the legs of the triangle.
2. When you solve for one of the legs and substitute values, you obtain that the result is: