Padovan Minimal Pisot Binet solution in Mathematica



This Minimal Pisot is also a fractal tile generator of some note!
Compare the two outputs:
{0, 1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 12, 16, 21, 28, 37, 49, 65, 86, 114, 151, 200, 265, 351, 465, 616}
{-1, 1, 0, 1, 2, 2, 3, 4, 4, 7, 8, 12, 16, 21, 28, 37, 49, 65, 86, 114, 151, 200, 265, 351, 465}
Notebook:
M = {{0, 1, 0}, {0, 0, 1}, {1, 1, 0}}
w[0] = {0, 1, 1};
w[n_] := w[n] = M.w[n - 1]
a0 = Table[w[n][[1]], {n, 0, 25}]
Det[M - x*IdentityMatrix[3]]
NSolve[Det[M - x*IdentityMatrix[3]] == 0, x]
NSolve[x^3 - x - 1 == 0, x]
b0 = 1.32471795724474605`;
b1 = -0.662358978622373051` - 0.562279512062301289` I;
b2 = -0.662358978622373051` + 0.562279512062301289` I;
g[n_] := N[(x*b0^n + y*b1^n + z*b2^n)];
digits = 25
a = Table[g[n], {n, 1, digits}]
Solve[Table[a[[n]] - a0[[n]] == 0, {n, 1, 3}], {x, y, z}]
Solve[Table[a[[n]] - a0[[n]] == 0, {n, 2, 4}], {x, y, z}]
Solve[Table[a[[n]] - a0[[n]] == 0, {n, 3, 5}], {x, y, z}]
x = 0.4114955886626457;
y = 0.29425220566867694- 0.13811139432288674*I;
z = 0.29425220566867716+ 0.13811139432288672*I;
a2 = Table[Floor[Re[g[n]]], {n, 1, 25}]
Compare the two outputs:
{0, 1, 1, 1, 2, 2, 3, 4, 5, 7, 9, 12, 16, 21, 28, 37, 49, 65, 86, 114, 151, 200, 265, 351, 465, 616}
{-1, 1, 0, 1, 2, 2, 3, 4, 4, 7, 8, 12, 16, 21, 28, 37, 49, 65, 86, 114, 151, 200, 265, 351, 465}

Roger L. Bagula { email: rlbagula@xxxxxxxxxxxxx or rlbagulatftn@xxxxxxxxx }

11759 Waterhill Road,
Lakeside, Ca. 92040 telephone: 619-561-0814
.



Relevant Pages

  • Re: Two results of set geometry
    ... digits of pi and a subsequent 5 cannot be distinguished from pi as ... cannot compare it to pi because pi then does not and cannot exist. ... given enough time and stability of the representation and having ... Everything that exists, exists in physics, is limited by physics ...
    (sci.math)
  • Re: Reading specific memory address into variable
    ... I need to compare two numeric variables to ... If you could get to the mantissa and exponent of the number you're ... except it will be in binary significant digits (which can be ... converted to decimal significant digits by division by log10. ...
    (comp.lang.cpp)
  • Re: Victory for green lanes
    ... No Roger, it's been widely observed in action. ... "Risk" by John Adams is, ... I changed my driving habits when I realised I was rationalising my ... style to compare one with the other, ...
    (uk.rec.walking)
  • Re: Relative Cardinality
    ... > 90 additional digits are required to reach position 10^100. ... The number of digits needed to compare two magnitudes depends only on ... No one knows how much can be stored in the whole universe since no one ...
    (sci.math)
  • Re: Divisibility of a java.math.BigInteger object
    ... and possibly faster to just extract the two least significant ... digits and compare them with »00«. ... To access the internal representation of a BigInteger use ... represenataion in decimal digits, though I suspect that will be too ...
    (comp.lang.java.programmer)