Not a Collatz proof by elimination. Just an algorithm design…(sarcasm inserted)

Working on trying to find an algorithm that guarantees I find powers of two by only using composite odds to shuffle through all possibilities in infinite iterations… you know, when it’s even divide by two, and when it’s odd guarantee that the odd isn’t prime and that any evens you produce from the process will find powers of two over iterations. Turns out, I could only find one that worked…