MathGroup Archive 2010

[Date Index] [Thread Index] [Author Index]

Search the Archive

Re: Lucas 1874 Fibonacci as binomial sum generalization problem


I made a mistake in the root solve:

m71 = {{0,
   1, 0, 0, 0, 0, 0}, {0, 0, 1, 0, 0, 0, 0}, {0, 0,
    0, 1, 0, 0, 0}, {0, 0, 0, 0, 1, 0, 0}, {0, 0,
    0, 0, 0, 1, 0}, {0, 0, 0, 0, 0, 0, 1}, {1, 0, 0, 0, 0, 0, 1}}
CharacteristicPolynomial[m71, x]
Table[x /. NSolve[CharacteristicPolynomial[m71, x] == 0, x][[i]], {i,
1, 7}]
Abs[%]

With that the general polynomial solution appears to be:
x^(k+1)-x^k-1; k,1,2,3,...
Roger Bagula


  • Prev by Date: Re: Displaying Equations Symbolically and Numerically
  • Next by Date: Re: bibtex support in Mathematica 8
  • Previous by thread: Re: Lucas 1874 Fibonacci as binomial sum generalization problem
  • Next by thread: Root search on results of minimization with free parameter