You are not logged in.
Pages: 1
Offline
Hence, if n is the number of 1s,
Now
Thus
Hence we have the required formula
[align=center]
[/align]Last edited by JaneFairfax (2009-10-25 01:20:57)
Offline
Hi Jane;
Isn't it unfortunate the a_n do not continue a predictable pattern. I know you did not say they did. Just looking at your stuff.
Last edited by bobbym (2009-10-25 05:53:04)
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Hi Jane;
A recurrence like this, is similar to a full history recurrence. They are easy to solve:
Theorem: Every full history recurrence can be changed into a finite history recurrence by the method of differences.
Form a new recurrence:
Now subtract them and you have a finite history recurrence.
Last edited by bobbym (2009-10-25 09:55:40)
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
.
. . . . . . .
Offline
Pages: 1