|
Math Geeks, Halp!
|
View this Thread in Original format
| IpLaYWiTLiGhTs |
...or anyone with average discrete math skills.
Gotta find a solution to the following recurrence relation:
an = 2nan-1, a0 = 3
a1 = 2(1)(3) = 6
a2 = 2(2)(6) = 24
a3 = 2(3)(24) = 144
a4 = 2(4)(144) = 1152
an = ???
This is driving me crazy!!! |
|
|
| Halcyon+On+On |
Hmm.
Well 6*4= 24. 24*6=144. 144*8=1152. Does that point you in the right direction? |
|
|
| Ted Promo |
| quote: | Originally posted by Halcyon+On+On
42. |
|
|
|
| Sushipunk |
| quote: | Originally posted by Ted Promo | quote: | Originally posted by Halcyon+On+On
42. |
|
|
|
|
| Lews |
| Stu, stop using your magical heathen quoting skills! |
|
|
| butterfly |
| i thought i was good at math, but i think i had too much wine to be able to read that one. |
|
|
| WittyHandle |
| Now what's the question? |
|
|
| IpLaYWiTLiGhTs |
| quote: | Originally posted by WittyHandle
Now what's the question? |
Find a solution (formula) that will find you any term (n) you plug in.
Basically you find another way to express the first formula given but without using an-1. It eliminates the need need to know the first term in the sequence, 3. |
|
|
| FuzzQi |
 |
|
|
| Pokit |
your solution is: 6n * (n-1)! * 2^(n-1)
note that 0! = 1
btw, how the hell do you do subscript/superscript on this forum? |
|
|
| Pokit |
| quote: | Originally posted by Meat187
an = 3*2n*(n-1)! |
HA! you're too late
edit: damnit, i just realized a problem in my solution
edit2: why did you delete your post, it was right... |
|
|
|
|
