Give a recurrence relation that describes the sequence 3, 6, 12, 24, 48, 96, 192, ....see screenshot..
a good first start is to see what the differences between terms are
Also, check if they're all multiples of each other.
3 6 12 24 48 96 192 3 6 12 24 48 96 <-- notice that each new term is double the one before it
Which suggests that the series is given by powers of 2 multiplied by the original term.
if we wanted an explicit formula, yes
Oh yeah, recurrence relation. Just doubling will do for that.
\[a_n = k~a_{n-1}\] \[a_n - k~a_{n-1}=0\] \[r^n - k~r^{n-1}=0\] \[r^{n-1}(r - k)=0~:~r=k\] \[a_n=C(k)^n\] when we know the first few terms \[a_1=C(k)^1=M\] \[C=\frac Mk\] i just learneded that the other day ....
so if n=1 then p(n)=1? because 1^2 =1?
@amistre64
p(1) is just the first term thats in front, it has to be defined in order to be able to actually start creating the sequence from the rule. p(1) = 3
the rule can be seen from the difference levels; the second row is the number that is added to the "top left" to get to the number on the "top right": to get from 3 to 6, you have to add 3. to get from 6 to 12, you have to add 6; to get from n to n+1, you have to double n 3 6 12 24 48 96 192 3 6 12 24 48 96 <-- notice that each new term is double the one before it
so it would be n^2 for the n-1?
No, An=2A(n-1)
Got it! the first answer is 3 and second one is 2! Thanks!
Yeah, it's An=3*2^n.
Join our real-time social learning platform and learn together with your friends!