The zero-entry conjecture for satisfying Loosened Collatz tuples

At least 4 years old · documented by

Let a tuple (y1,…,yn)(y_1,\dots,y_n) be satisfying when it satisfies the Loosened Collatz Function, and let (2,2,…)(2,2,\ldots) denote the constant tuple with every entry equal to 22. Zero-entry conjecture. Excluding the tuple (2,2,…)(2,2,\ldots), a tuple satisfying the Loosened Collatz Function must include 00 in its entry. The claim predicts that every nonconstant satisfying tuple contains a zero entry; the source gives no resolution, so it remains open.

References

Primary source

Q Le and Edward Smith, “Observations on cycles in a variant of the Collatz Graph”, arXiv:2109.01180 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.