A New Criterion for the First Case of Fermat's Last Theorem

DOI10.2307/2153341zbMath0817.11022OpenAlexW2086531091MaRDI QIDQ4325736

Ladislav Skula, Karl Dilcher

Publication date: 8 August 1995

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2153341

zbMATH Keywords

computational methodsBernoulli numbersFermat equationMirimanoff polynomials

Mathematics Subject Classification ID

Bernoulli and Euler numbers and polynomials (11B68) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40) Higher degree equations; Fermat's equation (11D41)

Related Items (4)

Congruences involving the Fermat quotient ⋮ Sums of reciprocals modulo composite integers ⋮ Congruences concerning Bernoulli numbers and Bernoulli polynomials ⋮ Congruences for Wolstenholme primes

This page was built for publication: A New Criterion for the First Case of Fermat's Last Theorem