back to table · edit · history · where entries came from · files
\ e in f.factor():\n out += [(g, root) for root, m in g.roots(IR)\n \ \ if root.lower() > 1 and root.upper() < phi.lower()]\n return\- \ out[0]\npolys = [P(n) for n in range(2, 30)] + [Q(n) for n in range(2, 30)]\+ \ out[0]\npolys = [P(n) for n in range(2, 41)] + [Q(n) for n in range(2, 41)]\ \ + [E]\nsorted((pisot_root(f) for f in polys), key=lambda t: t[1].lower())[:10]" Similar tables:
complete: 'no' complete-note: it holds the root of $E$ and the roots of $P_n$ and $Q_n$ for $2\leq- n\leq40$, which are $\theta_1$ to $\theta_{79}$; at $n=40$ the largest root is- still more than $1.9\cdot10^{-9}$ below $\varphi$, while by $n=72$ the roots are- within $10^{-15}$ of $\varphi$+ n\leq40$, which are $\theta_1$ to $\theta_{79}$; the cutoff keeps the largest+ root more than $1.9\cdot10^{-9}$ below the accumulation point $\varphi$, while+ by $n=72$ the roots are within $10^{-15}$ of $\varphi$ and close to the resolution+ of double-precision output rigour details: 'The generator uses the Dufresnoy-Pisot classification as recorded in CITE{Bertin} and CITE{McKeeSmyth}. It forms the exact integer polynomials in
Sign in to restore an earlier version.
