I Is the Expanded Collatz Sequence Unique for Each k Value?

  • I
  • Thread starter Thread starter elcaro
  • Start date Start date
  • Tags Tags
    Sequence
AI Thread Summary
The discussion centers on the uniqueness of the expanded Collatz sequence for different k values, specifically examining the modification of the sequence by replacing 3n+1 with 3n+2k+1. Participants note that while the original sequence leads to a known cycle (4-2-1), varying k values produce different cycles, such as 3-12-6-3 for k=1. There is uncertainty about whether this expanded sequence has been previously explored, with references to various Wikipedia pages indicating potential overlaps with existing generalizations. The conversation also touches on the complexity of these mathematical problems, echoing sentiments from mathematician Paul Erdös regarding their difficulty. The primary inquiry remains whether the cycles produced by different k values are unique and independent of the initial seed number.
elcaro
Messages
129
Reaction score
30
TL;DR Summary
Expanding the Collatz sequence by replacing 3n+1 with 3n+2k+1 for k=0,1,2,...
For k=0 we get the original sequence, leading to the cycle 4-2-1. If the Collatz conjecture holds, that would be true for all integer values of n>0.
For values of k>0 we get different cycles.
For k=1 we for instance get the cycle 3-12-6-3
What we want to investigate is:
- What cycle is the sequence iterating to for different values of k?
- Is that cycle unique for k (independent of the seed number)?
Has this expanded Collatz sequence been explored previously?
 
Mathematics news on Phys.org
fresh_42 said:
I haven't seen this one. But even Wikipedia lists so many generalizations
https://it.wikipedia.org/wiki/Congettura_di_Collatz
https://de.wikipedia.org/wiki/Collatz-Problem
https://en.wikipedia.org/wiki/Collatz_conjecture
that yours might have been among them. Compare especially the Syracuse function.

I am with Erdös:
I think my expanded form of the Collatz sequence is already covered as a special case of the natural generalization of the Collatz sequence, explored by Conway.
 
elcaro said:
TL;DR Summary: Expanding the Collatz sequence by replacing 3n+1 with 3n+2k+1 for k=0,1,2,...
For k=0 we get the original sequence, leading to the cycle 4-2-1. If the Collatz conjecture holds, that would be true for all integer values of n>0.
For values of k>0 we get different cycles.
For k=1 we for instance get the cycle 3-12-6-3
What we want to investigate is:
- What cycle is the sequence iterating to for different values of k?
- Is that cycle unique for k (independent of the seed number)?

Has this expanded Collatz sequence been explored previously?
If you want to have more information about the cycle(s) of Collatz, watch this short video on Youtube:
 
Thread 'Video on imaginary numbers and some queries'
Hi, I was watching the following video. I found some points confusing. Could you please help me to understand the gaps? Thanks, in advance! Question 1: Around 4:22, the video says the following. So for those mathematicians, negative numbers didn't exist. You could subtract, that is find the difference between two positive quantities, but you couldn't have a negative answer or negative coefficients. Mathematicians were so averse to negative numbers that there was no single quadratic...
Thread 'Unit Circle Double Angle Derivations'
Here I made a terrible mistake of assuming this to be an equilateral triangle and set 2sinx=1 => x=pi/6. Although this did derive the double angle formulas it also led into a terrible mess trying to find all the combinations of sides. I must have been tired and just assumed 6x=180 and 2sinx=1. By that time, I was so mindset that I nearly scolded a person for even saying 90-x. I wonder if this is a case of biased observation that seeks to dis credit me like Jesus of Nazareth since in reality...
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...
Back
Top