A Is this Recursive Pattern in the Collatz Sequence Known?

AI Thread Summary
The discussion centers on the analysis of the Collatz sequence, specifically the transitions between successive odd numbers and their valuation jumps. The author has identified a recursive pattern in the seeds of odd integers that produce specific valuation jumps, defined by a formula involving periodic coefficients. They seek confirmation on whether this recursive structure is known in existing literature and request insights into potential mathematical paths for proving it. Participants acknowledge the complexity of the Collatz conjecture, referencing notable mathematicians' caution regarding its study, while also sharing personal experiences with related mathematical challenges. The conversation emphasizes the need for formal peer-reviewed research to validate findings in this intricate area of mathematics.
MrHellmet
Messages
2
Reaction score
0
TL;DR Summary
I am empirically studying the transitions between successive odd numbers in the Collatz sequence, focusing on the change in the 2-adic valuation (Δv) between steps. I've observed that integers with a constant Δv form arithmetic progressions.
Hello everyone,I've been empirically analyzing the transitions between successive odd numbers in the Collatz sequence (m_{new} = (3m_{old}+1)/2^N).I've observed that odd integers that produce a specific "valuation jump", \Delta v = v_2(3m_{new}+1) - v_2(3m_{old}+1), seem to fall into arithmetic progressions. I've been studying the 'seed' of these progressions, defined as the smallest positive odd integer m satisfying the conditions for a given family.For the family of integers with an initial valuation v_2(3m+1) = 2, the seeds for positive valuation jumps (\Delta v = k \geq 1) appear to follow this recursive formula:

a(k) = a(k-1) + C_{pos}(2,k) \cdot 2^{k+3}

Here, a(k) is the seed for a jump of \Delta v = k, and the starting seed is a(1)=17. The coefficient C_{pos}(2,k) is periodic depending on

k \pmod 6:C_{pos}(2,k) = \begin{cases} 3 & \text{if } k \equiv 3 \pmod 6 \\ -1 & \text{if } k \equiv 0 \pmod 6 \\ 1 & \text{otherwise} \end{cases}

For example, this correctly predicts the seed for \Delta v = 2:a(2) = a(1) + C_{pos}(2,2) \cdot 2^{2+3} = 17 + (1) \cdot 32 = 49.My questions are:1. Is this specific recursive structure, or the periodic nature of its coefficient, a known result in the literature on the 3n+1 problem?2. If it is not a known result, does anyone see a potential path or a related mathematical structure that could help in proving it?I have verified this and similar patterns for other families extensively, but I haven't been able to find a formal proof. Any references or insights would be greatly appreciated.
 
Last edited:
Mathematics news on Phys.org
If anyone has seen this it is likely terence tao

Heres a paper he published on the conjecture

https://arxiv.org/pdf/1909.03562

In general, mathematicians play with the conjecture for a short time to understand the depth and quirkiness of it but don’t devote their lives to it.

Mathematicians will tell their students to steer clear of it citing Erdos who famously said math is not yet ready for this kind of problem.

Personally, I have played with it using modulo arithmetic. The idea was to show inductively that for any seed number and any modulo up to that number evaluated to 1 after iterating through the sequence but i ran into a few roadblocks where I’d get a zero and then things fell apart unless I replaced the zero with the modulo number ala clock arithmetic.
 
Last edited:
jedishrfu said:
If anyone has seen this it is likely terence tao

Heres a paper he published on the conjecture

https://arxiv.org/pdf/1909.03562

In general, mathematicians play with the conjecture for a short time to understand the depth and quirkiness of it but don’t devote their lives to it.

Mathematicians will tell their students to steer clear of it citing Erdos who famously said math is not yet ready for this kind of problem.

Thank you for this very thoughtful and insightful response. I really appreciate it.Thank you especially for the link to Tao's paper. I am familiar with his work, and I agree his approach is very deep. My framework is quite different as it focuses more on the local, modular structure of the 2-adic valuation jumps from one odd number to the next.I completely understand your point about the problem's reputation and Erdos's famous quote. It is indeed a notoriously challenging area, which is why my goal was not to attempt a full proof, but to rigorously classify the local dynamics and see if any predictable structure emerged. and i obtained quite interesting patterns that seems to mantain for quite large ranges.
Your personal experience with modulo arithmetic is very interesting. The roadblock you mention is a classic challenge. It seems my approach is related but distinct, as I'm focused on the 'valuation jump' as the primary classifier.
Thanks again for taking the time to engage seriously with the question, in other pages people werent so polite.
 
Thank you, but I do need to remind you that we don't discuss personal research here on PF.

Once your research is peer reviewed and published in a reputable math journal we could if we have the expertise to do so.

However while doing your research you had a question on some step that confounded you we might be able to look at it.
 
  • Like
Likes MrHellmet and fresh_42
Suppose ,instead of the usual x,y coordinate system with an I basis vector along the x -axis and a corresponding j basis vector along the y-axis we instead have a different pair of basis vectors ,call them e and f along their respective axes. I have seen that this is an important subject in maths My question is what physical applications does such a model apply to? I am asking here because I have devoted quite a lot of time in the past to understanding convectors and the dual...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Back
Top