Diophantine equations with Euler polynomials

DOI10.4064/AA161-3-5MaRDI QIDQ2868211zbMATH OpenOpenAlexFDO

Authors Csaba Rakaczki, Dijana Kreso

Publication date 16 December 2013

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1312.3907

zbMATH Keywords

decompositionEuler polynomialshigher degree equations

Mathematics Subject Classification ID

Bernoulli and Euler numbers and polynomials (11B68) Higher degree equations; Fermat's equation (11D41)

Abstract: In this paper we determine possible decompositions of Euler polynomials $E_k(x)$, i.e. possible ways of writing Euler polynomials as a functional composition of polynomials of lower degree. Using this result together with the well-known criterion of Bilu and Tichy, we prove that the Diophantine equation ${\displaystyle }$-1^k +2 ^k - cdots + (-1)^{x} x^k=g(y),${\displaystyle }$ with $ginmathbbQ[X]$ of degree at least $2$ and $kgeq7$, has only finitely many integers solutions $x,y$ unless polynomial $g$ can be decomposed in ways that we list explicitly.

Recommendations

• Diophantine equations in separated variables and polynomial power sums
• A polynomial variant of a problem of Diophantus and Euler
• Diophantine equations with Appell sequences
• On some generalizations of the Diophantine equation \(s(1^{k}+2^{k}+\cdots +x^{k})+r=dy^{n}\)
• On some Diophantine results related to Euler polynomials

Cited in

(13)

• A polynomial variant of a problem of Diophantus and Euler
• Diophantine equations in separated variables
• Polynomial Diophantine equations with high multiplicity
• Polynomial values of products of terms from an arithmetic progression
• Elliptic binomial diophantine equations
• Some notes on alternating power sums of arithmetic progressions
• Diophantine equations with Appell sequences
• On the Diophantine equation \(1+x+\frac{x^2}{2!}+\cdots+\frac {x^n}{n!}=g(y)\)
• Polynomial values of (alternating) power sums
• On the decomposability of linear combinations of Bernoulli polynomials
• Indecomposability of the polynomials \(P(x)=f(x)^n(x-a_1)^{k_1}\cdots (x-a_m)^{k_m}\)
• Effective results for polynomial values of (alternating) power sums of arithmetic progressions
• Diophantine equations with truncated binomial polynomials

This page was built for publication: Diophantine equations with Euler polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2868211)