J n = ⎩ ⎪ ⎨ ⎪ ⎧ 0 1 J n − 1 + 2 J n − 2 if n = 0 ; if n = 1 ; if n > 1 .
Jacobsthal Numbers are defined by the recurrence relation as described above. Evaluate: n = 0 ∑ ∞ 1 0 n + 1 J n .
If the value of the above expression is in the form A − 1 , find A .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The best way is to use difference equation . That process is more classic. But well done.
Relevant wiki: Recurrence Relations
S = = ⟹ 1 0 S = ⟹ S + 1 0 S = 1 1 S = = ∴ S = n = 0 ∑ ∞ 1 0 n + 1 J n 1 0 0 + 1 0 2 1 + 1 0 3 1 + 1 0 4 3 + 1 0 5 5 + 1 0 6 1 1 + 1 0 8 2 1 + … 1 0 3 1 + 1 0 4 1 + 1 0 5 3 + 1 0 6 5 + 1 0 7 1 1 + 1 0 8 2 1 + … 1 0 2 1 + 1 0 3 2 + 1 0 4 4 + … 1 0 1 + 1 0 2 2 + 1 0 3 4 + … [ Infinite GP ] 1 − 1 0 2 1 0 1 = 8 1 8 8 1
Bonus :Show that 3 J n + ( − 1 ) n = 2 n ,where J n denotes the n th Jacobsthal Number.
On solving the given recurrence, we get :- J n = 3 1 ( 2 n − ( − 1 ) n ) . It can easily be seen that 3 ⋅ J n + ( − 1 ) n = 2 n .
Nice problem! Thanks for citing my problem as an inspiration :)
Log in to reply
Your problem was very cool.Congratulations,you solved it :)!
Log in to reply
Thanks! Although, sadly, it was a ripoff of a similar problem, but the series was defined as a 1 = a 2 = a 3 = 1 , a n = a n − 1 + a n − 2 + a n − 3 for n ≥ 4
Log in to reply
@Manuel Kahayon – Oh,that's painful.Nevertheless, could you link me with the problem?
Log in to reply
@Rohit Udaiwal – No links. It was a written problem on our training test paper...
Log in to reply
@Manuel Kahayon – Ohk.!BTW I like your problems a lot.Please keep posting :)
Log in to reply
@Rohit Udaiwal – Thanks! (This is an extension of the comment since 1-word comments are not allowed)
Log in to reply
@Manuel Kahayon – I really think one-word comments should be allowed here. @Andrew Ellinor
Log in to reply
@Rohit Udaiwal – Then take it up with me in the Brilliant Lounge :P
Let
f
(
x
)
=
J
0
+
J
1
x
+
J
2
x
2
+
⋯
.
From the recurrence relation we have
f
(
x
)
(
1
−
x
−
2
x
2
)
=
x
i.e.
f
(
x
)
=
1
−
x
−
2
x
2
x
The sum
=
1
0
1
f
(
1
0
1
)
=
8
8
1
A
=
8
8
The link just gives away the formula J n = 3 1 ( 2 n − ( − 1 ) n )
Thanks,I've removed that link.
Problem Loading...
Note Loading...
Set Loading...
J 0 = 0 , J 1 = 1 & J n = J n − 1 + 2 J n − 2 ⇒ 1 0 n + 1 J n = 1 0 1 . 1 0 n J n − 1 + 1 0 0 2 . 1 0 n − 1 J n − 2 ⇒ ∑ n = 2 ∞ 1 0 n + 1 J n = 1 0 1 ∑ n = 2 ∞ 1 0 n J n − 1 + 1 0 0 2 ∑ n = 2 ∞ 1 0 n − 1 J n − 2 ⇒ A − 1 0 2 J 1 − 1 0 J 0 = 1 0 1 ( A − 1 0 J 0 ) + 1 0 0 2 A ⇒ A − 1 0 0 1 − 0 = 1 0 1 ( A − 0 ) + 1 0 0 2 A ⇒ 1 0 0 8 8 A = 1 0 0 1 ⇒ A − 1 = 8 8