![]() |
|
|
#1 |
|
Jun 2003
158210 Posts |
For a given integer k, the sequence is defined as :-
S(0)=0 S(n)=(1-S(n-1))/k What is the formula for the nth term? Show that for large values of n the nth term converges on 1/(k+1) for k>1
|
|
|
|
|
|
#2 | |
|
Feb 2017
Nowhere
4,643 Posts |
Quote:
S(k) = (1-S(k -1))/k What is the formula for the kth term? Show that for large values of k the kth term converges on 1/(k+1) for k>1 ? |
|
|
|
|
|
|
#3 |
|
Jun 2003
22×3×421 Posts |
|
|
|
|
|
|
#4 |
|
Jun 2003
2×7×113 Posts |
For k=3
S(0)=0 S(1)=(1-0)/3=1/3 S(2)=(1-1/3)/3=2/9 S(3)=(1-2/9)/3=7/27 ... Hope this helps |
|
|
|
|
|
#5 |
|
Jun 2003
116748 Posts |
The closed form of S(n) looks to be (k^n-(-1)^n) / ((k+1)*k^n)
|
|
|
|
|
|
#6 | |
|
Feb 2017
Nowhere
10010001000112 Posts |
Quote:
For n > 0, S(n) clearly is which is a partial sum of a geometric series with first term 1/k and ratio -1/k. Closed form for S(n) already given. S(n) |
|
|
|
|
|
|
#7 |
|
Romulan Interpreter
Jun 2011
Thailand
961110 Posts |
Ha! We remember we have seen this (or similar) sometime ago in a video about a "proof" of the famous 1+2+3+...=-1/12 (let k slowly decrease to 1, to get that the limit of the sequence 1, 0, 1, 0, 1, 0,... is 0.5, practically from there start all the "layman" proofs of the above). We watched it a couple of times, and gave up after a while, something was still missing, or our brain was not developed enough...
|
|
|
|
![]() |
Similar Threads
|
||||
| Thread | Thread Starter | Forum | Replies | Last Post |
| A new sequence | devarajkandadai | Miscellaneous Math | 3 | 2020-12-01 22:08 |
| Primes in n-fibonacci sequence and n-step fibonacci sequence | sweety439 | And now for something completely different | 17 | 2017-06-13 03:49 |
| A New Sequence | devarajkandadai | Math | 3 | 2007-03-20 19:43 |
| What's the next in the sequence? | roger | Puzzles | 16 | 2006-10-18 19:52 |
| Sequence | Citrix | Puzzles | 5 | 2005-09-14 23:33 |