The zero-entry conjecture for satisfying Loosened Collatz tuples
The zero-entry conjecture for satisfying Loosened Collatz tuples
Let a tuple be satisfying when it satisfies the Loosened Collatz Function, and let denote the constant tuple with every entry equal to . Zero-entry conjecture. Excluding the tuple , a tuple satisfying the Loosened Collatz Function must include in its entry. The claim predicts that every nonconstant satisfying tuple contains a zero entry; the source gives no resolution, so it remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Sources & referencesView supporting material
Primary source
Q Le and Edward Smith, “Observations on cycles in a variant of the Collatz Graph”, arXiv:2109.01180 (2023).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.