Integer Sequences associated with Integer Monic Polynomial

2000/01/20 by Ashok Kumar Gupta, Gupta, Ashok Kumar, Ashok Mittal +2 · 1 citation
Computer Science · Mathematics · #Advanced Mathematical Identities #Mathematical functions and polynomials #Polynomial and algebraic computation #math.GM

paper · pdf · doi:10.48550/arxiv.math/0001112

6 pages, no figures

arxiv created 2000/01/20 · arxiv updated 2009/11/30

Abstract

To every integer monic polynomial of degree m can be associated m integer sequences having interesting properties to the roots of the polynomial. These sequences can be used to find the real roots of any integer monic polynomial by using recursion relation involving integers only. This method is faster than the conventional methods using floating point arithmetic.

Cited by

• Symbolic computation of the roots of any polynomial with integer coefficients

Related

• A `replacement sequence' method for finding the largest real root of an integer monic polynomial
• Symbolic computation of the roots of any polynomial with integer coefficients
• Roots of any Polynomial with Complex Integer Coefficients using Replacement Sequences, Ruler and Compass
• Counting polynomials with positive roots
• The Integer Sequence Transform a ↦ b where b_n is the Number of Real Roots of the Polynomial a₀ + a₁x + a₂x² + ⋯ + a_nxⁿ