Bounds for Fermat quotients via hexagonal interpolation determinants

We obtain explicit upper bounds for the p-adic valuation of x^{p-1} - 1, the numerator in the defining expression for the Fermat quotient. For coprime integer bases x, y >= 2 and an odd prime p not dividing xy, the bound has leading term 15(p - 1)(log x)(log y)/(log p)^2. When x = 2 and y = 3, the coefficient is 13. The proof uses an interpolation determinant evaluated at lattice points of a hexagonal region. A binomial expansion gives a local lower bound without factorial loss, while the geometry controls the exponents jointly in the Archimedean upper bound. If both bases are quadratic residues modulo p, the leading term can be halved. As an application, we bound the logarithm of an odd perfect number in terms of contributions to its sum of divisors with nontrivial multiplicative order.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-21
DOI
https://doi.org/10.5281/zenodo.24412619
Primary Topic
Analytic Number Theory Research
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Bounds for Fermat quotients via hexagonal interpolation determinants

Paulo Vieira
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

Bounds for Fermat quotients via hexagonal interpolation determinants

Paulo Vieira
preprint en

Abstract

We obtain explicit upper bounds for the p-adic valuation of x^{p-1} - 1, the numerator in the defining expression for the Fermat quotient. For coprime integer bases x, y >= 2 and an odd prime p not dividing xy, the bound has leading term 15(p - 1)(log x)(log y)/(log p)^2. When x = 2 and y = 3, the coefficient is 13. The proof uses an interpolation determinant evaluated at lattice points of a hexagonal region. A binomial expansion gives a local lower bound without factorial loss, while the geometry controls the exponents jointly in the Archimedean upper bound. If both bases are quadratic residues modulo p, the leading term can be halved. As an application, we bound the logarithm of an odd perfect number in terms of contributions to its sum of divisors with nontrivial multiplicative order.

Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
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