On a sequence of polynomials (Q1358898)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1025691
Language Label Description Also known as
default for all languages
No label defined
    English
    On a sequence of polynomials
    scientific article; zbMATH DE number 1025691

      Statements

      On a sequence of polynomials (English)
      0 references
      0 references
      26 November 1997
      0 references
      For any integer \(k\geq 2\) let \(p_k\) be a polynomial defined by \(p_k(X)= (X+1)^k -X^k-1\). It is easy to see that \(p_k\) is divisible by \(X\), \(X(X+1)\), \(X(X^2 +X+1)\) and \(X(X+1)\) \((X^2+ X+1)^2\) if \(k\) is even, \(k\equiv 3\pmod 6\), \(k\equiv 5\pmod 6\) and \(k\equiv 1 \pmod 6\), respectively. In connection with studies of solutions to the Korteweg-de Vries equation, J. Sanders asked if, for any \(l>k>1\), \(\text{gcd} (p_k,p_l)\) contains only the trivial divisors mentioned above. In this paper the author proposes a positive reply to this question.
      0 references
      0 references
      polynomials
      0 references
      factorisation
      0 references
      greatest common divisor
      0 references
      Korteweg-de Vries equation
      0 references

      Identifiers