|
Post by R on Mar 26, 2002 15:13:10 GMT -5
whats the formula to get 2,0,2,0,2? and 1,3,7,15,31?
I missed those lectures because of illness and now I'm lost.
|
|
Polska
Full Member
"Let the blood of our enemies stain the battlefield" - Polska
Posts: 42
|
Post by Polska on Mar 26, 2002 18:44:19 GMT -5
1,3,4,5,6,7............. any hints?
|
|
bAh
Junior Member
Posts: 23
|
Post by bAh on Mar 26, 2002 22:06:10 GMT -5
whats the formula to get 2,0,2,0,2? and 1,3,7,15,31? I missed those lectures because of illness and now I'm lost. okk... let see.... for the 2 0 2 0 2...i heard from a friend that we can seperate it into cases like..... if n = even , then f(x) = some # and if n = odd, then f(x) = some other #... etc i think one of the other question in the solution manual used this approach now... for the other one.... 1, 3, 7, 15, 31, well... any hints will give the answer away.... but what the heck so we have A1, A2, A3 terms etc right? ever noticed that each term is strangely related to some # which is related to the number 2? ;D
|
|
|
Post by R on Mar 27, 2002 14:56:20 GMT -5
ah! thank you bah!
|
|
|
Post by Rogue_Knight on Mar 27, 2002 20:56:08 GMT -5
observation: the 2 0 2 0 2 sequence oscillates around 1... that should be enough hint
|
|
|
Post by Rogue_Knight on Mar 27, 2002 22:48:03 GMT -5
is 56 is a typo! it's actually an+1=3an-2n-1
so the pattern goes 1, 3, 7, 15, 31, 63...
(I just figured this out myself... so it might not be true)
|
|
|
Post by R on Mar 27, 2002 23:09:47 GMT -5
since its so late i dnno if there will be any replies...
do we need induction to prove An to work?
|
|
|
Post by Rogue_Knight on Mar 27, 2002 23:32:18 GMT -5
my TA sez if we have time we should 'cuz Joel didnt' tell him
|
|
|
Post by LaevisX on Mar 27, 2002 23:39:01 GMT -5
is 56 is a typo! it's actually a n+1=3a n-2 n-1so the pattern goes 1, 3, 7, 15, 31, 63... (I just figured this out myself... so it might not be true) Hmm, that would make more sense But seeing as no announcement was made regarding this typo, I think we can safely bet this question won't be marked... Anyhoo I'm keeping my original answer: a=1 if n=1, a=n+1 if n>1 It's not as if the actual answer is that much harder to figure out anyways...
|
|