Eisenstein's criterion, Fermat's last theorem, and a conjecture on powerful numbers

DOI10.7546/NNTDM.2019.25.2.22-29MaRDI QIDQ6285344zbMATH OpenWikidataFDO

Authors Pietro Paparella

Publication date 5 April 2017

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Higher degree equations; Fermat's equation (11D41) Goldbach-type theorems; other additive questions involving primes (11P32)

Abstract: Given integers $ell>m>0$, we define monic polynomials $X_n$, $Y_n$, and $Z_n$ with the property that $mu$ is a zero of $X_n$ if and only if the triple $(mu,mu+m,mu+ell)$ satisfies $x^n+y^n=z^n$. It is shown that the irreducibility of these polynomials implies Fermat's last theorem. It is also shown, in a precise asymptotic sense, that for a vast majority of cases, these polynomials are irreducible via Eisenstein's criterion. We conclude by offering a conjecture on powerful numbers.

This page was built for publication: Eisenstein's criterion, Fermat's last theorem, and a conjecture on powerful numbers

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