"Searching for Collatz counterexamples" by Oliver K. Clay
  •  
  •  
 

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?

DOI

10.5642/jhummath.YQHO7207

Terms of Use & License Information

Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.

Plum Print visual indicator of research metrics
PlumX Metrics
  • Usage
    • Downloads: 854
    • Abstract Views: 247
  • Mentions
    • References: 1
see details

Share

COinS