Descent methods for studying integer points on $y^{n}=f(x)g(x),\ n\ge 2$
From MaRDI portal
Publication:6410995
arXiv2209.07909MaRDI QIDQ6410995
Publication date: 16 September 2022
Computer solution of Diophantine equations (11Y50) Number-theoretic algorithms; complexity (11Y16) Counting solutions of Diophantine equations (11D45) Higher degree equations; Fermat's equation (11D41)
This page was built for publication: Descent methods for studying integer points on $y^{n}=f(x)g(x),\ n\ge 2$
