The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
We determine decomposition properties of Euler polynomials and using a strong result relating polynomial decomposition and diophantine equations in two separated variables, we characterize those g(x) ∈ ℚ [x] for which the diophantine equation
with k ≥ 7
may have infinitely many integer solutions. Apart from the exceptional cases we list explicitly, the equation has only finitely many integer solutions.
Download Results (CSV)