Abstract / Synopsis
Despite decades of effort, the Collatz conjecture remains neither proved, nor refuted by a counterexample, nor formally shown to be undecidable. This note introduces the Collatz problem and probes its logical depth with a test question: can the search space for counterexamples be iteratively reduced, and when would it help?
Oliver K. Clay, "The Long Search for Collatz Counterexamples," Journal of Humanistic Mathematics, Volume 13 Issue 2 (July 2023), pages 199-227. DOI: 10.5642/jhummath.YQHO7207. Available at: https://scholarship.claremont.edu/jhm/vol13/iss2/13
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.