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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Absence of Primary Odd Edges in Primitive Euler Bricks

Viktor Solov’yov
Zenodo (CERN European Organization for Nuclear Research)
Algebraic Geometry and Number Theory
preprint

Absence of Primary Odd Edges in Primitive Euler Bricks

Viktor Solov’yov
preprint en

Abstract

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.

Zenodo (CERN European Organization for Nuclear Research)
Algebraic Geometry and Number Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon