MATHEMATICS / NUMBER THEORY
CENTL-CBX
An exact arithmetic laboratory for Erdős–Straus decomposition geometry and reproducible certificates.
- Current state
- Research framework
- Discipline
- Mathematics · Number theory
- Built with
- C / Python / Exact integer arithmetic / GitHub Actions
The idea
The Erdős–Straus conjecture asks whether 4/n can always be written as the sum of three positive unit fractions for every integer n greater than one. CENTL-CBX studies exact candidate decompositions, obstruction structure and certificate construction.
How it works
C kernels and Python analyzers preserve exact Type-I and signed-box Type-II state. Independent research lanes expose geometry and survivor structure; executable theorem modules and verifier scripts distinguish proved state transitions from scheduling annotations.
What’s implemented
- Exact decomposition search and signed-box geometry analysis
- Independent research lanes and survivor-state classification
- Certificate discovery with executable verifier modules
PROJECT STATUS / RESEARCH FRAMEWORK
Where it stands
Exact research framework
- The Erdős–Straus conjecture remains open
- The current framework is a developing decomposition mechanism, not a proof of the conjecture
- Heuristics and directional annotations confer no proof authority
Source & resources
Documentation behind this project page
Reviewed October 1, 2026. Project descriptions reflect a source review; repository validation claims were not independently reproduced.