Amanote Research

Amanote Research

    RegisterSign In

Computably Categorical Fields via Fermat’s Last Theorem

Computability - Netherlands
doi 10.3233/com-13017
Full Text
Open PDF
Abstract

Available in full text

Categories
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsArtificial IntelligenceMathematics
Date

January 1, 2013

Authors
Russell MillerHans Schoutens
Publisher

IOS Press


Related search

An Elementary Proof of Fermat’s Last Theorem

Mathematics Letters
2017English

Geometric Note to the Last Fermat’s Theorem

Mathematics Letters
2017English

Three Summation Criteria for Fermat’s Last Theorem

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1983English

Fermat’s Last Theorem (Case $1$) and the Wieferich Criterion

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1990English

New Bound for the First Case of Fermat’s Last Theorem

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1989English

Fermat’s Last Theorem in the Context of the Modern Natural-Science Knowledge

GISAP:History and Philosophy
2014English

About One Particular Case of Fermat’s Theorem

Scientific and Technical Volga region Bulletin
2017English

Errata: ‘‘On Fermat’s Last Theorem” [Trans.\ Amer.\ Math.\ Soc. {\Bf 31} (1929), No. 4, 613–642; 1501503]

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1931English

Pick's Theorem via Minkowski's Theorem

American Mathematical Monthly
Mathematics
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy