Coprime Decimations of Decimal Repunit Expansions: Cyclotomic Norms, Digit Geometry, and Entropy

Coprime Decimations of Decimal Repunit Expansions studies a simple arithmetic operation on a repeating decimal: multiply its digit positions by a nonzero residue modulo the period. For a decimal repunit with prime index at least five, every nonzero numerator has a decimation coprime to the denominator. The theorem applies even to initially noncoprime numerators and requires no squarefreeness assumption. A quantitative bound in terms of digit variance and the least prime divisor guarantees asymptotically at least one-half of the decimation parameters, uniformly over all numerators. At almost every prime index, a strict majority succeeds. The proof compares two descriptions of a cyclotomic norm. Vanishing conjugates modulo a prime force prime-power divisibility through the nullity of an integer multiplication matrix; Parseval's identity bounds the same norm from above. Inverting a suitable decimation shows that a repunit in this family is composite exactly when some coprime numerator has a noncoprime decimation. Signed contrasts give further bounds on the witness alphabet and digit window. Geometric and entropy results explain what this arithmetic information adds. Numerator ensembles have a universal mean edge length, while the complete period spectrum at a squared denominator recovers its divisors. At repunit powers, an exact coupling of remainder grids gives a growing-window entropy deficit tending to log 9 at squares and the corresponding integer multiples at fixed higher powers. These statistical laws hold for prime and composite repunits alike. Appendices develop run-core geometry, two-run prime reciprocals, factorization carries, sparse-factor restrictions, periodic length corrections, Midy cancellations, and the decimal cofactor gap, with classical inputs explicitly credited. The project contains complete analytical arguments, ten reproducible vector figures, editable sources, and supplementary verification programs. The least unsigned witness, unrestricted carry classifications, and the full prime-denominator normalized-area limit set remain unresolved. No improvement in factoring complexity or proof of decimal repunit-prime infinitude is asserted.

Authors

Publication Details

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

Coprime Decimations of Decimal Repunit Expansions: Cyclotomic Norms, Digit Geometry, and Entropy

K. Fathi
3 links
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
article

Coprime Decimations of Decimal Repunit Expansions: Cyclotomic Norms, Digit Geometry, and Entropy

K. Fathi
article en

Abstract

Coprime Decimations of Decimal Repunit Expansions studies a simple arithmetic operation on a repeating decimal: multiply its digit positions by a nonzero residue modulo the period. For a decimal repunit with prime index at least five, every nonzero numerator has a decimation coprime to the denominator. The theorem applies even to initially noncoprime numerators and requires no squarefreeness assumption. A quantitative bound in terms of digit variance and the least prime divisor guarantees asymptotically at least one-half of the decimation parameters, uniformly over all numerators. At almost every prime index, a strict majority succeeds. The proof compares two descriptions of a cyclotomic norm. Vanishing conjugates modulo a prime force prime-power divisibility through the nullity of an integer multiplication matrix; Parseval's identity bounds the same norm from above. Inverting a suitable decimation shows that a repunit in this family is composite exactly when some coprime numerator has a noncoprime decimation. Signed contrasts give further bounds on the witness alphabet and digit window. Geometric and entropy results explain what this arithmetic information adds. Numerator ensembles have a universal mean edge length, while the complete period spectrum at a squared denominator recovers its divisors. At repunit powers, an exact coupling of remainder grids gives a growing-window entropy deficit tending to log 9 at squares and the corresponding integer multiples at fixed higher powers. These statistical laws hold for prime and composite repunits alike. Appendices develop run-core geometry, two-run prime reciprocals, factorization carries, sparse-factor restrictions, periodic length corrections, Midy cancellations, and the decimal cofactor gap, with classical inputs explicitly credited. The project contains complete analytical arguments, ten reproducible vector figures, editable sources, and supplementary verification programs. The least unsigned witness, unrestricted carry classifications, and the full prime-denominator normalized-area limit set remain unresolved. No improvement in factoring complexity or proof of decimal repunit-prime infinitude is asserted.

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