COUNTEREXAMPLES TO ORDOWSKI'S CONJECTURE AND ALMOST-PRIME CONSTELLATIONS AT DOUBLY EXPONENTIAL OFFSETS

Ordowski conjectured that 9, 15, 195 are the only integers k > 2 for which k ± 22mare prime whenever 22m< k. We give seven counterexamples and completely classify theten solutions below 236 by exact arithmetic. For the associated constellations with 2r shifts,we determine the local obstruction counts from the multiplicative order of 2 and establishuniform bounds for the singular series. A blockwise combinatorial sieve yields an unconditionalasymptotic for rough constellations in prescribed doubly exponential intervals. A divisor-subsetestimate then gives square-free, pairwise coprime almost-prime constellations whose largestindividual prime-factor count is at most (e + ε) log(2r) for every fixed ε > 0. Infinitude ofgenuine prime constellations and a dimension-independent almost-prime bound remain open.

Authors

Publication Details

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

COUNTEREXAMPLES TO ORDOWSKI'S CONJECTURE AND ALMOST-PRIME CONSTELLATIONS AT DOUBLY EXPONENTIAL OFFSETS

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

COUNTEREXAMPLES TO ORDOWSKI'S CONJECTURE AND ALMOST-PRIME CONSTELLATIONS AT DOUBLY EXPONENTIAL OFFSETS

Tony Newton
preprint en

Abstract

Ordowski conjectured that 9, 15, 195 are the only integers k > 2 for which k ± 22mare prime whenever 22m< k. We give seven counterexamples and completely classify theten solutions below 236 by exact arithmetic. For the associated constellations with 2r shifts,we determine the local obstruction counts from the multiplicative order of 2 and establishuniform bounds for the singular series. A blockwise combinatorial sieve yields an unconditionalasymptotic for rough constellations in prescribed doubly exponential intervals. A divisor-subsetestimate then gives square-free, pairwise coprime almost-prime constellations whose largestindividual prime-factor count is at most (e + ε) log(2r) for every fixed ε > 0. Infinitude ofgenuine prime constellations and a dimension-independent almost-prime bound remain 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