Absence of Primary Odd Edges in Primitive Euler Bricks
This paper investigates the classical Diophantine problem of the existence of primitive Euler bricksrectangular parallelepipeds with coprime integer edges and integer face diagonals. While the impossibility of a primary odd edge is known from classical results on minimal prime divisors and quadratic residues, this study provides a new, completely elementary and constructive proof for an odd primary edge of the form pn (p > 2 is prime, n ≥ 2), based on a unied analytical method of divisor parameterization. Directly from the system of Euler brick equations, a characteristic Diophantine equation is derived, its canonical parameterization is obtained, the bounds for the index parameters are rigorously established, and the absence of integer solutions is proven. Combined with the earlier result for n = 1,this completely rules out the class of primary odd edges within a unied framework. Keywords: Euler brick, Diophantine equations, primary numbers, Pythagorean triples, modular arithmetic, fundamental theorem of arithmetic.
Authors
- Viktor Solov’yov (ORCID: https://orcid.org/0000-0002-3283-1752)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-14
- DOI
- https://doi.org/10.5281/zenodo.24217571
- Primary Topic
- Algebraic Geometry and Number Theory
- Type
- preprint