On the irreducibility of some polynomials in two variables

DOI10.4064/aa-82-3-303-307zbMath0922.11018OpenAlexW1534821009MaRDI QIDQ4369676

Ákos Pintér, Bela Brindza

Publication date: 8 January 1998

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/207094

zbMATH Keywords

irreducibility of polynomialshigher degree diophantine equations

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Higher degree equations; Fermat's equation (11D41)

Related Items (2)

The Diophantine equation f(x)=g(y)$f(x)=g(y)$ for polynomials with simple rational roots ⋮ On the Diophantine equation \(F(\binom{x}{n})=b\binom{y}{m}\)

This page was built for publication: On the irreducibility of some polynomials in two variables