On the Diophantine Equation G n (x) = G m (y) with Q (x, y)=0
From MaRDI portal
Publication:3530433
DOI10.1007/978-3-211-74280-8_10zbMath1215.11031OpenAlexW98922915MaRDI QIDQ3530433
Robert F. Tichy, Clemens Fuchs, Attila Pethoe
Publication date: 20 October 2008
Published in: Diophantine Approximation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-211-74280-8_10
Recurrences (11B37) Counting solutions of Diophantine equations (11D45) Exponential Diophantine equations (11D61) Linear Diophantine equations (11D04)
Related Items
Effective bounds for the zeros of linear recurrences in function fields ⋮ Perfect powers in polynomial power sums ⋮ Decomposable polynomials in second order linear recurrence sequences ⋮ Composite values of polynomial power sums
Cites Work
- Algebraic function fields and codes
- Effective bounds for the zeros of linear recurrences in function fields
- Finiteness of integral values for the ratio of two linear recurrences
- On the Diophantine equation \(G_n(x)=G_m(P(x))\) for third order linear recurring sequences
- The zero multiplicity of linear recurrence sequences
- On the integer solutions of exponential equations in function fields.
- On the Diophantine equation \(G_{n}(x) = G_{m}(P(x))\)
- Linear equations in variables which lie in a multiplicative group
- On the Diophantine equation 𝐺_{𝑛}(𝑥)=𝐺_{𝑚}(𝑃(𝑥)): Higher-order recurrences
- The Diophantine equation f(x) = g(y)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the Diophantine Equation G n (x) = G m (y) with Q (x, y)=0