Added 6th method. This does not remember aanything about number previously seen. It just knows the longest number of times you could possibly have to iterate to reach 1 or 0 and iterates up to this many times, giving up if does not reach a 0 or 1. It is as fast as the original hash marking seen method on my machine and requires almost no memory.