PRIME SANDWICHES: ALGEBRAIC OBSTRUCTIONS AND ARBITRARILY DENSE MODULAR COVERINGS

A prime sandwich is obtained by adjoining the same posi-tive number of decimal ones to both ends of a prime. Sycamore askedwhether infinitely many prime centres admit no prime sandwich. Wesettle the listed case 1249 by an identity valid at every length, classifyall prime centres whose associated quadratic is reducible, and prove thatthree other listed quadratics remain irreducible under every monomialsubstitution associated with an arithmetic progression of lengths. Ourmain result constructs, for each J ≥ 1, a positive-lower-relative-densityset of prime centres for which every wrapping length not divisible by3 · 2J produces a composite. The construction uses elementary cyclo-tomic factors, the Chinese remainder theorem and the prime numbertheorem for arithmetic progressions. We also identify a necessary orderconstraint on every finite covering. The infinitude of centres having noprime sandwich at any length remains open.

Authors

Publication Details

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

PRIME SANDWICHES: ALGEBRAIC OBSTRUCTIONS AND ARBITRARILY DENSE MODULAR COVERINGS

Tony Newton
Zenodo (CERN European Organization for Nuclear Research)
Analytic Number Theory Research
preprint

PRIME SANDWICHES: ALGEBRAIC OBSTRUCTIONS AND ARBITRARILY DENSE MODULAR COVERINGS

Tony Newton
preprint en

Abstract

A prime sandwich is obtained by adjoining the same posi-tive number of decimal ones to both ends of a prime. Sycamore askedwhether infinitely many prime centres admit no prime sandwich. Wesettle the listed case 1249 by an identity valid at every length, classifyall prime centres whose associated quadratic is reducible, and prove thatthree other listed quadratics remain irreducible under every monomialsubstitution associated with an arithmetic progression of lengths. Ourmain result constructs, for each J ≥ 1, a positive-lower-relative-densityset of prime centres for which every wrapping length not divisible by3 · 2J produces a composite. The construction uses elementary cyclo-tomic factors, the Chinese remainder theorem and the prime numbertheorem for arithmetic progressions. We also identify a necessary orderconstraint on every finite covering. The infinitude of centres having noprime sandwich at any length remains open.

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