The Diogo Sousa Algorithm: An Exact Triadic Identity Between Binary and Decimal Bases
This paper formalizes a previously undocumented exact identity that bridges power-of-two values with the decimal system. While the approximation 210 is approximately 103 is a cornerstone of computer science, the Diogo Sousa Algorithm provides an absolute identity valid for all n in R, decomposing any power of two into a triadic sum of decimal components scaled by binary factors.
Authors
- Diogo Sousa
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-05-02
- DOI
- https://doi.org/10.5281/zenodo.19979308
- Primary Topic
- Polynomial and algebraic computation
- Type
- article
- Field-Weighted Citation Impact
- 0.00