arXiv (All)
open access
Primitive norm extraction and a signed descent for the cubic Fermat equation
We give a self-contained proof of the cubic case of Fermat's theorem through a signed form of Euler's descent, with the required extraction step proved directly in $\mathbb{Z}[\sqrt{-3}]$. A pigeonhole argument of Thue represents the relevant primes by $X^2+3Y^2$, and explicit division in $\mathbb{Z
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The part of Fermat's theorem#742777
- Advanced topics in computational number theory#490244
- Euclidean SVP is NP-hard for Cyclic Lattices#1122720
- The new Fermat-type factorization algorithm#1062762
- Transcendence of Montgomery Reduction Factor in the Ring of Integers Modulo Infinitely Large Primes#1084740
Record · ID 1076222
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive