Polynomial values of (alternating) power sums (Q519912): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / reviewed by
 
Property / reviewed by: István Mezö / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: István Mezö / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2185613410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On alternating power sums of arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On equal values of power sums of arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A refinement of Faulhaber's theorem concerning sums of powers of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A superelliptic equation involving alternating sums of powers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Diophantine equation $1^k+2^k+\dotsb+x^k=y^n$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic factors of f(x) -g(y) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Diophantine equation f(x) = g(y) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4533267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Euler and Bernoulli polynomials. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On some generalizations of the diophantine equation $1^k + 2^k + ... + x^k = y^z$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3708856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equation $1^k + 2^k + ... + x^k = y^z$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4888639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational approach for solving $y^2=1^k+2^k+\dotsb+x^k$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine equations with Bernoulli polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of Diophantine equations involving Bernoulli polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5188092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3023603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the simple zeros of shifted Euler polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diophantine equations with Euler polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equation \(1^p+2^p+3^p+\ldots+n^p=m^q\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4488096 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equation $f(1)1^k + f(2)2^k + ... + f(x)x^k + R(x)= by^z$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4301630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4884992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Diophantine equation \(1^k+2^k+\dots +x^k+R(x)=y^2\) / rank
 
Normal rank

Latest revision as of 15:20, 13 July 2024

scientific article
Language Label Description Also known as
English
Polynomial values of (alternating) power sums
scientific article

    Statements

    Polynomial values of (alternating) power sums (English)
    0 references
    0 references
    31 March 2017
    0 references
    The author considers diophantine problems related to power sums and alternating power sums. A general power sum has the form \[ S_{a,b}^k(x)=b^k+(a+b)^k+\cdots+(a(x-1)+b)^k, \] while a general alternating power sum is definded as \[ T_{a,b}^k(x)=b^k-(a+b)^k+(2a+b)^k-\cdots+(-1)^{x-1}(a(x-1)+b)^k. \] \(S_{a,b}^k(x)\) and \(T_{a,b}^k(x)\) can be expressed by the Bernoulli and Euler polynomials, respectively: \[ S_{a,b}^k(x)=\frac{a^k}{k+1}\left(B_{k+1}\left(x+\frac{b}{a}\right)-B_{k+1}\left(\frac{b}{a}\right)\right), \] \[ T_{a,b}^k(x)=\frac{a^k}{2}\left(E_{k}\left(\frac{b}{a}\right)+(-1)^{x-1}E_{k}\left(x+\frac{b}{a}\right)\right). \] Note that the latter expression is not a polynomial in \(x\), but the two functions \[ T_{a,b}^{k\pm}(x)=\frac{a^k}{2}\left(E_{k}\left(\frac{b}{a}\right)\pm E_{k}\left(x+\frac{b}{a}\right)\right) \] are already polynomials. The diophantine problem studied in the paper is the following. Let us fix a rational polynomial \(g(y)\) of degree at least 3, and then we are looking for integers \(x\) and \(y\) such that \[ S_{a,b}^k(x)=g(y), \] and, similarly, \[ T_{a,b}^{k\pm}(x)=g(y). \] The author proves that, apart from some special cases, both of these equations have only finitely many solutions. The results are ineffective in the sense that specific bound on the solutions is not provided.
    0 references
    Diophantine equation
    0 references
    Bernoulli polynomial
    0 references
    Euler polynomial
    0 references
    0 references

    Identifiers