Reducing Gilbreath's Conjecture to a Local Condition: How much of the triangle do we really need to watch?

We present a reduction of Gilbreath’s Conjecture to an explicit local bound. Specifically, we show that the conjecture follows from the condition |Gᵣ[2] − Gᵣ[1]| ≤ 2 for all r ≥ 1. We state four supporting lemmas used by the reduction, describe a minimal preimage structure associated with a model minimal violating configuration, and report computational verification of the local bound through 100,000 rows. The full conjecture remains open, but the remaining target is now clearly isolated. For correspondence and updates: BMorgan007(at)protonmail.com

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-03-21
DOI
https://doi.org/10.5281/zenodo.19143644
Primary Topic
Limits and Structures in Graph Theory
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Reducing Gilbreath's Conjecture to a Local Condition: How much of the triangle do we really need to watch?

Blair Morgan
Zenodo (CERN European Organization for Nuclear Research)
Limits and Structures in Graph Theory
article

Reducing Gilbreath's Conjecture to a Local Condition: How much of the triangle do we really need to watch?

Blair Morgan
article en

Abstract

We present a reduction of Gilbreath’s Conjecture to an explicit local bound. Specifically, we show that the conjecture follows from the condition |Gᵣ[2] − Gᵣ[1]| ≤ 2 for all r ≥ 1. We state four supporting lemmas used by the reduction, describe a minimal preimage structure associated with a model minimal violating configuration, and report computational verification of the local bound through 100,000 rows. The full conjecture remains open, but the remaining target is now clearly isolated. For correspondence and updates: BMorgan007(at)protonmail.com

Zenodo (CERN European Organization for Nuclear Research)
Reduced inequalities
Openalex Percentile: Top 12%
Limits and Structures in Graph 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.