Looking on wikipedia through the unsolved problems list, I found a conjecture that I (who's been busy with this for many, many years) have never come across before:
The Juggler sequence.
Take a number a. If it's even, take the square root and round down. If it's odd, cube the number, then take the square root, and then round down. The conjecture says that every number goes down to 1.
As expected, no clue how you would go about proving this, but it's interesting to see something so similar yet different to Collatz. If anything, this seems harder than Collatz, as you also have to round down which I guess messes even more with the number-theoretical properties of the sequence.
"It's pointless attempting to solve the conjecture by calculating big numbers and calling it a day !"
Yeah and people there offten remind others it's next to impossible than a random redditor would solve the conjecture, this is post is a call for random stuff about the conjecture and not a try-hard attempt.
I've calculated :
15141312111098765432123456789101112131415 ^54321 had a stopping time of 52 499 672
This was done by just crushing raw computation rather than any form of more elegant proof, and many of the 52 499 672 steps are a bit too big to make every number be reasonably stored on a regular computer, let alone share it on the internet ...so yeah I can understand if you think i'm making stuff up since I can't really prove it.
Estimated the initial number would be vaguely above e2 172 840 , if my maths aren't horrible
edit : or the initial number would be roughtly around (1.39050991021^54 321) * (2^7 224 693)
(btw yes technically you can just take 2^100 000 000 and call it a day, we know what will be the stopping time )
An entire Collatz sequence for any n can be summarized as ((3x)(n))+m/(2y). For example 5’s sequence can be written as (((31)(5))+1)/(24) and 13’s can be written as (((32)(13))+11)/(27). Let d(n) be the digital root function for some natural number n. I’ve noticed that d(m-x)≡0 mod 5.
I’ve only tried a handful of examples and have no idea how I’d prove it. I’m also not sure what proving it would do to help solve the Collatz Problem. Any counter-examples or tips on proving it would be helpful. Especially, tips on the implications of this (if it’s true) regarding Collatz would be appreciated.
Using non-prime factorization as example, I suggest we prove Collatz conjecture using exponents to build additive based whole numbers. I feel as if this would be best done in a uniform manner, using shortest exponent integer paths possible (2^n).
Below I will list our n=1 through n=10 through exponent building.
n=1=(2^0)
n=2=(2^1)
n=3=((2^0)+(2^1))
n=4=(2^2)
n=5=((2^2)+(2^0))
n=6=((2^2)+(2^1))
n=7=((2^2)+(2^1)+(2^0))
n=8=(2^3)
n=9=((2^3)+(2^0))
n=10=((2^3)+(2^1))
This allows prime effect (non-reduction) to be thought of as exponential moments:
One exponential moment= (2^n)
two exponential moment= ((2^n)+(2^n))
Three exponential moments= ((2^n)+(2^n)+(2^n))
Four exponential moments= ((2^n)+(2^n)+(2^n)+(2^n))
Or one edit of (2^n) or (2^a) if moments have different variables.
Collatz is: 3x+1 odds, where x/2 evens
Collatz unphased suggested (3x+1)/2
Collatz unphased reversed 2((x-1)/3)
When using exponential builds:
((2^0)+(2^1))(x)+(2^0) odds where (x)/(2^1)
(((2^0)+(2^1))(x)+(2^0))/(2^1)
(2^1)((x-(2^0))/((2^0)+(2^1)))
once we have realized this building mechanism, we can send the 4,2,1 to equilateral across zero settings.
4=2^2
2=2^1
1=2^0
our 2^n variable allows (4,2,1) as 2^n where n=(2,1,0)
n=(2,1,0) where n-1 becomes (-1,0,1) for uniform exchange to positive to negative spectrum.
Conclusion: Collatz is all positive spectrum infinity. The more we push n, the higher digits we retain, but at its base, its a repeating process of indefinite suspension through looping mechanisms.
if 3x= 3 moments of time, where +1 is linear observation (our experience) and x/2 is how we "lose moment energy to propel through time", then Collatz would state that time is more of an infinite flow or circular nature
The difference in all positive spectrum vs normal. diameter=2n where n=radius.
radius is both positive and negative. 2n forces a dual positive n for projection into the positive only space.
Notes on dimensional space:
1d is 2 rays of infinite expansion
2d is 4 rays of infinite expansion
3d is 6 rays of infinite expansion
4d is 6 rays of infinite expansion in 2 moments of time
5d is 6 rays of infinite expansion in 3 moments of time
6d is 6 rays of infinite expansion in 4 moments of time
7d is 6 rays of infinite expansion in 5 moments of time
8d is 6 rays of infinite expansion in 6 moments of time
9d is 6 rays of infinite expansion in 7 moments of time
10d is 6 rays of infinite expansion in 8 moments of time
A while ago I was reading through "The Arithmetic of Dynamical Systems" and came across two mindblowing theorems. Today, while working on the conjecture, I looked through my notes again and remembered them, so I'll post them here because they're super interesting.
Please note that these theorems do not apply to the Collatz map, but I want to showcase them for their power and relevance.
The first one is Theorem 3.43. It states that if you have a rational map of degree 2 or higher, such that its second iterate is not a polynomial over Q... then its orbit will never contain an infinite amount of integers. Always finitely many integers.
This theorem is interesting because it can deal with the issue of diverging orbits. Basically, if we had some way of applying this to Collatz, we could say that no diverging orbit exists, because they would naturally contain an infinite amount of integers.. and by this theorem that is impossible!
The second one is Theorem 3.48. It states that for any rational map whose second iterate is not a polynomial over Q, the ratio of the numerator and the denominator of its iterated fractions will logarithmically converge to 1.
I'm not entirely sure what this means, but the nice thing is we need no degree 2 assumption here. I think this theorem says that basically it gets harder and harder for the map to attain integer values. This theorem is of particular interest because the Collatz map is of degree 1, and thus not covered by the first theorem.
That's it, figured I'd make a little post about them. Right now I'm working on creating a suitable category with suitable maps to hopefully generalize these theorems for (an amended and weakened version of) the Collatz map over Q.
I'm sorry about showing up and asking directly on a post here, but here's how it goes: I've decided to use the conjecture as a pseudo random generator, as it is consistent at providing various numbers and without repetitions. My problem lies on my lack of understanding about how hard it is to get a long sequence of operations going on most of the instances for large numbers, so I would like to know, if someone may know how do I figure out which numbers can get into more than 240 operations without reaching 1000000
(Rule a:) if n is even --> n/2 (Rule b:) if n is odd --> (3n+1)/2
Choose an arbitrary sequence of a's and b's, for example
abbabaabaaaa
and I'll give you a number that will fall into a power of 2 after that exact sequence of steps (in this example, 455475162313816086 ; with less a's at the end, it would have been just 22).
My name is Diony Victorin. I live in the Greater Seattle area. I have been working on the Conjecture since last March and I am happy to say that I am in the final steps to prove the Conjecture. I would love to meet with anyone interested to test my findings. Please if you are interested in seeing my 3 steps proof, let me know. I would love to meet with you.
Thales measured the height of the inaccessible pyramid and the distance of the unreachable ship from the harbor, demonstrating that anything that can be plotted on a plane can be measured; Euclid, with the product of known prime numbers, continually generates new primes and demonstrated that prime numbers are infinite; Peano, with the second of his five axioms, affirmed that for every natural number there exists a successor number +1. We will never be able to claim to have developed Euclid's inaccessible primes or Peano's unattainable number, but twin primes are two of the infinite primes, one of which is a successor number +2 of the other prime, and the sum of the two primes is always a number 6n; by representing even numbers in the form 6n or 6n±2 and odd numbers in the form 6n±1 or 6n±2±1, we can demonstrate that Euclid's inaccessible primes and Peano's unattainable successor number exist. All prime numbers, all twin primes, all Mersenne primes which are the sum of numbers in double proportion and generate the even perfect numbers, all odd numbers 3n of the Collatz algorithm whose successor +1 is a power 2^n_even which when halved is 2^(n-1) and ends at 2^0 = 1 and all even numbers and all odd numbers which are the sum of 2 or 3 primes, all exist and, even if they will never be known, the final digit of the prime numbers and of the successor number which can be a prime or composite number is known. https://vixra.org/abs/2601.0016
What I have in mind is instead of even divided by 2 it’s multiplied by 3+1 and odd divided by 2 and rounded up to the nearest whole number than do both the normal and changed formula and use negative numbers.
I’ve noticed a pattern that could be huge towards proving the Conjecture. Take the 4x+3 numbers: 3,7,11,15,19,23,27,31,35,39,43,47…
These numbers go below themselves with the following respectively: 2,5,10,10,11,20,23,23,20,38,37,46,…
Let A be set of numbers that 4x+3 numbers go below themselves with. Now, define a function with two possible outputs for the numbers in A where f(x)=1 iff x is prime, and f(x)=0 iff x is not prime. So, a pattern emerges among the numbers in A as follows: 1,1,0,0,1,0,1,1,0,0,1,0…
Since all 4x+1 numbers go below themselves trivially and 4x+1∪4x+3=2x+1, if it can be proven that the pattern holds for all 4x+3 numbers, then the Conjecture is true.