Asked by ben!
Write a recursive formula that generates the terms of the following:
. . .1, 3, 9, 27
my answer:
t1=1, n>2 --> tn= 3tn-1
is this correct?
Let's test
You have the sequence 1, 3, 9, 27 ...
You wrote
t<sub>1</sub>=1, n>2 => t<sub>n</sub>= 3t<sub>n</sub>-1
What is t<sub>2</sub>? It's undefined so I don't know how to continue.
I think you're supposed to observe that the sequence is powers of 3
1=3<sup>0</sup>, 3<sup>1</sup>, 3<sup>2</sup>, 3<sup>3</sup>, ...
Let t<sub>1</sub>=1 and t<sub>n</sub>=3t<sub>n-1</sub>
Try that and see if it works.
. . .1, 3, 9, 27
my answer:
t1=1, n>2 --> tn= 3tn-1
is this correct?
Let's test
You have the sequence 1, 3, 9, 27 ...
You wrote
t<sub>1</sub>=1, n>2 => t<sub>n</sub>= 3t<sub>n</sub>-1
What is t<sub>2</sub>? It's undefined so I don't know how to continue.
I think you're supposed to observe that the sequence is powers of 3
1=3<sup>0</sup>, 3<sup>1</sup>, 3<sup>2</sup>, 3<sup>3</sup>, ...
Let t<sub>1</sub>=1 and t<sub>n</sub>=3t<sub>n-1</sub>
Try that and see if it works.
Answers
There are no human answers yet.
There are no AI answers yet. The ability to request AI answers is coming soon!
Submit Your Answer
We prioritize human answers over AI answers.
If you are human, and you can answer this question, please submit your answer.