The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Education » math-teach

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: Which Polynomial?
Replies: 28   Last Post: Jul 27, 2006 3:13 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 59
Registered: 1/30/05
Re: Which Polynomial?
Posted: Jul 31, 2005 1:53 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

>> No, no, Kirby. Look at the sequence f1^n+f2^n. Every
>> recursively-generated sequence has a generating
>> polynomial. f1 and f2 are the two roots.

> No really, the usual thing is to approach phi using two successive terms of
> the sequence. That's not to say your exercise is irrelevant though --
> although the sequence I'm getting from your instructions isn't
> 0,1,1,2,3,5,8,13... but 1,3,4,7,11,18,29...

f[n] = q^n satisfies the Fibonacci recurrence relation f[n] - f[n-1] -
f[n-2] = 0 (n=0,1,2,...) iff q^n - q^(n-1) - q^(n-2) = 0 (with q non zero)
that is, q^2 - q - 1 = 0.

The roots are then q(1) = (1+SQRT5)/2 and q(2) = (1-SQRT5)/2 both solutions
of the recurrence relation.

Since the relation is linear and homogeneous, the general solution is f[n] =
c(1)q(1)^n + c(2)q(2)^n for any choice of c(1) and c(2). In order to satisfy
the (two) initial values f(0) = 0 and f(1) = 1, we determine c(1) = 1/SQRT5
and c(2) = -1/SQRT5 which gives the correct formula for f[n] corresponding
to the initial values 0 and 1.


Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.