- #1

- 2

- 0

## Main Question or Discussion Point

Hey, this is my first post, so... Hello everybody!

I've been looking into the Collatz conjecture, and like most mathematically minded people, been completely absorbed by it. I'm looking to bounce some ideas off other people, kind of a peer review of a couple things if you will.

I'll be the first to state that I'm nowhere near qualified, or intelligent, enough to call myself an expert, so feel free to correct me and tell me this was worked out a hundred years ago, I'd appreciate it.

I'm looking for a way to avoid checking every number up to

If every positive integer can be expressed as odd * 2

If this assumption is safe to make, we can instantly avoid the checking of every even positive integer, a 50% reduction in amount of numbers requiring checking.

Also, for every branch of the Collatz Tree, a new branch is created wherever [(odd * 2

If no sub-branch can ever be present, any odd positive integer divisible by 3 cannot possibly be reliant on any prior representation of itself in the Collatz Tree in order for itself to be represented in the Collatz Tree and thus cannot be part of the main sequence of an exception loop. Therefore, we can avoid checking odd positive integers that are divisible by 3. This can further reduce the numbers that require testing by 33%.

These 2 reductions leave us with testing 33% of numbers - something that can increase our search times greatly.

I hope I have explained myself well enough, it is one of my weaknesses.

What do you guys think?

I've been looking into the Collatz conjecture, and like most mathematically minded people, been completely absorbed by it. I'm looking to bounce some ideas off other people, kind of a peer review of a couple things if you will.

I'll be the first to state that I'm nowhere near qualified, or intelligent, enough to call myself an expert, so feel free to correct me and tell me this was worked out a hundred years ago, I'd appreciate it.

I'm looking for a way to avoid checking every number up to

*n*when looking for an exception to the Collatz Conjecture.If every positive integer can be expressed as odd * 2

^{n}such that prime numbers are p * 2^{0}and powers of 2 are 1 * 2^{n}and branches of the Collatz Tree begin with an odd positive integer followed by that odd positive integer multiplied by 2^{n}where*n*is the number of steps to get back to the odd positive integer, would it be safe to assume that for each odd positive integer present in the Collatz Tree every even positive integer of the form odd * 2^{n}would be present?If this assumption is safe to make, we can instantly avoid the checking of every even positive integer, a 50% reduction in amount of numbers requiring checking.

Also, for every branch of the Collatz Tree, a new branch is created wherever [(odd * 2

^{n}) - 1] % 3 == 0. With this in mind, if 3 is a factor of odd, then 3 is also a factor of odd * 2^{n}and as such [(odd * 2^{n}) - 1] % 3 == 2. Therefore, for any branch where 3 is a factor of the base odd positive integer, no sub-branch can ever be created.If no sub-branch can ever be present, any odd positive integer divisible by 3 cannot possibly be reliant on any prior representation of itself in the Collatz Tree in order for itself to be represented in the Collatz Tree and thus cannot be part of the main sequence of an exception loop. Therefore, we can avoid checking odd positive integers that are divisible by 3. This can further reduce the numbers that require testing by 33%.

These 2 reductions leave us with testing 33% of numbers - something that can increase our search times greatly.

I hope I have explained myself well enough, it is one of my weaknesses.

What do you guys think?