<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: The Collatz Conjecture</title>
	<atom:link href="http://jpcameron.com/blog/?feed=rss2&#038;p=47" rel="self" type="application/rss+xml" />
	<link>http://jpcameron.com/blog/?p=47</link>
	<description>Where I post my thoughts</description>
	<lastBuildDate>Sat, 04 May 2013 12:25:46 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.1</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>By: Huen Yeong Kong</title>
		<link>http://jpcameron.com/blog/?p=47&#038;cpage=1#comment-321</link>
		<dc:creator>Huen Yeong Kong</dc:creator>
		<pubDate>Sat, 04 May 2013 12:25:46 +0000</pubDate>
		<guid isPermaLink="false">http://jpcameron.com/blog/?p=47#comment-321</guid>
		<description>I was a control system engineer working with temperature, level, flow and pH control sytems.  The Collatz algorithm looks more and more like these
control systems which are 2nd ordered negative feedback control systems.  Nonlinearity does get involved and some disturbance will cause unstable divergence.  Behaviour of Collatz algorithm follws such patterns quite closely.  Control systems were already in commercial use before 1937.  I suspect Collatz translated these models into number theory.  However not being a number theorist, I could only guess.
HueYK</description>
		<content:encoded><![CDATA[<p>I was a control system engineer working with temperature, level, flow and pH control sytems.  The Collatz algorithm looks more and more like these<br />
control systems which are 2nd ordered negative feedback control systems.  Nonlinearity does get involved and some disturbance will cause unstable divergence.  Behaviour of Collatz algorithm follws such patterns quite closely.  Control systems were already in commercial use before 1937.  I suspect Collatz translated these models into number theory.  However not being a number theorist, I could only guess.<br />
HueYK</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Harry altoft</title>
		<link>http://jpcameron.com/blog/?p=47&#038;cpage=1#comment-288</link>
		<dc:creator>Harry altoft</dc:creator>
		<pubDate>Sat, 21 Apr 2012 20:15:54 +0000</pubDate>
		<guid isPermaLink="false">http://jpcameron.com/blog/?p=47#comment-288</guid>
		<description>Perhaps consider this

Any odd number is squared and then one is taken away, any even number is divided by two, ill youll find it very interesting</description>
		<content:encoded><![CDATA[<p>Perhaps consider this</p>
<p>Any odd number is squared and then one is taken away, any even number is divided by two, ill youll find it very interesting</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Tony N</title>
		<link>http://jpcameron.com/blog/?p=47&#038;cpage=1#comment-275</link>
		<dc:creator>Tony N</dc:creator>
		<pubDate>Tue, 04 Oct 2011 01:07:36 +0000</pubDate>
		<guid isPermaLink="false">http://jpcameron.com/blog/?p=47#comment-275</guid>
		<description>Interesting - I can&#039;t say I have ever seem this game before, but it appears simple enough. Basically it is just a function of how long it takes for the number to become a binary value, at which point it will collapse.</description>
		<content:encoded><![CDATA[<p>Interesting &#8211; I can&#8217;t say I have ever seem this game before, but it appears simple enough. Basically it is just a function of how long it takes for the number to become a binary value, at which point it will collapse.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Rakesh K. Sharma</title>
		<link>http://jpcameron.com/blog/?p=47&#038;cpage=1#comment-272</link>
		<dc:creator>Rakesh K. Sharma</dc:creator>
		<pubDate>Fri, 05 Aug 2011 02:23:05 +0000</pubDate>
		<guid isPermaLink="false">http://jpcameron.com/blog/?p=47#comment-272</guid>
		<description>I know you all are waiting for a proof for Collatz Conjecture, and your wait is coming to an end. I have solved this problem, however, last 3 days I spent in ER, so did not get time to type my proof. 

I have also sent my proofs for Fermat&#039;s Last theorem and Catalan&#039;s Conjecture for publication. My proofs will shock the number theory world that such a simple proofs did exist for these problems. 

All this work has been done in just last 2 months of time. 

I left math in 1992 when I was fed up with University Politics and started working for Industries. I had never even imagined that I will solve these problems with such an ease. Proofs presented by me have already been checked by math professors, who have found these proofs quite fascinating. Now I am just waiting to have these published before you all will get a chance to see these proofs.

So just wait for few more months to see these proofs.</description>
		<content:encoded><![CDATA[<p>I know you all are waiting for a proof for Collatz Conjecture, and your wait is coming to an end. I have solved this problem, however, last 3 days I spent in ER, so did not get time to type my proof. </p>
<p>I have also sent my proofs for Fermat&#8217;s Last theorem and Catalan&#8217;s Conjecture for publication. My proofs will shock the number theory world that such a simple proofs did exist for these problems. </p>
<p>All this work has been done in just last 2 months of time. </p>
<p>I left math in 1992 when I was fed up with University Politics and started working for Industries. I had never even imagined that I will solve these problems with such an ease. Proofs presented by me have already been checked by math professors, who have found these proofs quite fascinating. Now I am just waiting to have these published before you all will get a chance to see these proofs.</p>
<p>So just wait for few more months to see these proofs.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Someone</title>
		<link>http://jpcameron.com/blog/?p=47&#038;cpage=1#comment-270</link>
		<dc:creator>Someone</dc:creator>
		<pubDate>Sun, 10 Jul 2011 23:19:02 +0000</pubDate>
		<guid isPermaLink="false">http://jpcameron.com/blog/?p=47#comment-270</guid>
		<description>I have been fascinated by the Collatz conjecture for years too. Here I have something which is a result of my search and I think that may be the answer to the questions posed by the author. Here&#039;s the formula for the average (arithmetic mean) length of the Collatz the range from 1 to n. I think that the actual average length of the Collatz converge to this pattern, but I don&#039;t have (yet) a formal proof of this. And I checked only n less than 1001... Example:

C: 1,5x+0,5 if odd; x/2 if even

Number 1 - stopping time: 0

Number 2 - stopping time: 1

Number 3 - stopping time: 5

Number 4 - stopping time: 2

 = (0+1+2+5)/4 = 2

My general formula:

 = 2/ln(0.75) * [n*(ln(1/n)+1)-1)]/n

The best results we obtain for large n, example n=1000:

 = 39,89

My general formula: 

 = 41,08</description>
		<content:encoded><![CDATA[<p>I have been fascinated by the Collatz conjecture for years too. Here I have something which is a result of my search and I think that may be the answer to the questions posed by the author. Here&#8217;s the formula for the average (arithmetic mean) length of the Collatz the range from 1 to n. I think that the actual average length of the Collatz converge to this pattern, but I don&#8217;t have (yet) a formal proof of this. And I checked only n less than 1001&#8230; Example:</p>
<p>C: 1,5x+0,5 if odd; x/2 if even</p>
<p>Number 1 &#8211; stopping time: 0</p>
<p>Number 2 &#8211; stopping time: 1</p>
<p>Number 3 &#8211; stopping time: 5</p>
<p>Number 4 &#8211; stopping time: 2</p>
<p> = (0+1+2+5)/4 = 2</p>
<p>My general formula:</p>
<p> = 2/ln(0.75) * [n*(ln(1/n)+1)-1)]/n</p>
<p>The best results we obtain for large n, example n=1000:</p>
<p> = 39,89</p>
<p>My general formula: </p>
<p> = 41,08</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Someone</title>
		<link>http://jpcameron.com/blog/?p=47&#038;cpage=1#comment-269</link>
		<dc:creator>Someone</dc:creator>
		<pubDate>Sun, 10 Jul 2011 22:33:50 +0000</pubDate>
		<guid isPermaLink="false">http://jpcameron.com/blog/?p=47#comment-269</guid>
		<description>Finally proven? Error found:

[quote]Author&#039;s note:
The reasoning on p. 11, that &quot;The set of all vertices (2n; l) in all levels will
contain all even numbers 2n &gt; 6 exactly once.&quot; has turned out to be incomplete.
Thus, the statement &quot;that the Collatz conjecture is true&quot; has to be withdrawn,
at least temporarily.
June 17, 2011[/quote]</description>
		<content:encoded><![CDATA[<p>Finally proven? Error found:</p>
<p>[quote]Author&#8217;s note:<br />
The reasoning on p. 11, that &#8220;The set of all vertices (2n; l) in all levels will<br />
contain all even numbers 2n &gt; 6 exactly once.&#8221; has turned out to be incomplete.<br />
Thus, the statement &#8220;that the Collatz conjecture is true&#8221; has to be withdrawn,<br />
at least temporarily.<br />
June 17, 2011[/quote]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Aaron</title>
		<link>http://jpcameron.com/blog/?p=47&#038;cpage=1#comment-266</link>
		<dc:creator>Aaron</dc:creator>
		<pubDate>Thu, 02 Jun 2011 15:42:49 +0000</pubDate>
		<guid isPermaLink="false">http://jpcameron.com/blog/?p=47#comment-266</guid>
		<description>Finally proven... http://bit.ly/kQK8fy</description>
		<content:encoded><![CDATA[<p>Finally proven&#8230; <a href="http://bit.ly/kQK8fy" rel="nofollow">http://bit.ly/kQK8fy</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ernst Berg</title>
		<link>http://jpcameron.com/blog/?p=47&#038;cpage=1#comment-261</link>
		<dc:creator>Ernst Berg</dc:creator>
		<pubDate>Wed, 09 Feb 2011 12:11:53 +0000</pubDate>
		<guid isPermaLink="false">http://jpcameron.com/blog/?p=47#comment-261</guid>
		<description>One more thing..

In the [3x+1,x/2]

We can look at this as two sets of data. Set one is the 3x+1 data and the other is the x/2 data.
Even and odd numbers are a part of both sets.
x=1 means 4,13,40,121....  it&#039;s a progression
and given the constraints of dividing only numbers that have a power of two in them you can see that after a 3x+1 the even value that is present is a member of both sets but not a second even iif that even value can be divided by 4,8 and so on.
So the two systems share one element.  The even after an 3x+10
I believe I was generating progressions to make the sets such as x=1 [2x] and x = 1 [3x+1] when I noticed the common element .
 So they share a common value because in [3x+1] x can be an even value and even values are part of the progressions that make a complete set of values for [3x+1] 
Remember I use brackets to denote cycle . I don&#039;t know if anyone else does.

So the common element concept is another thing you guys might look at and see if it helps. I&#039;m sure I have some C code some place .  I work with C Code to explore things so I have a program for everything rather than a paper with equations.

Okay then..  If I can be of help.. 

Ernst_Berg@Sbcglobal.net</description>
		<content:encoded><![CDATA[<p>One more thing..</p>
<p>In the [3x+1,x/2]</p>
<p>We can look at this as two sets of data. Set one is the 3x+1 data and the other is the x/2 data.<br />
Even and odd numbers are a part of both sets.<br />
x=1 means 4,13,40,121&#8230;.  it&#8217;s a progression<br />
and given the constraints of dividing only numbers that have a power of two in them you can see that after a 3x+1 the even value that is present is a member of both sets but not a second even iif that even value can be divided by 4,8 and so on.<br />
So the two systems share one element.  The even after an 3x+10<br />
I believe I was generating progressions to make the sets such as x=1 [2x] and x = 1 [3x+1] when I noticed the common element .<br />
 So they share a common value because in [3x+1] x can be an even value and even values are part of the progressions that make a complete set of values for [3x+1]<br />
Remember I use brackets to denote cycle . I don&#8217;t know if anyone else does.</p>
<p>So the common element concept is another thing you guys might look at and see if it helps. I&#8217;m sure I have some C code some place .  I work with C Code to explore things so I have a program for everything rather than a paper with equations.</p>
<p>Okay then..  If I can be of help.. </p>
<p><a href="mailto:Ernst_Berg@Sbcglobal.net">Ernst_Berg@Sbcglobal.net</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ernst Berg</title>
		<link>http://jpcameron.com/blog/?p=47&#038;cpage=1#comment-260</link>
		<dc:creator>Ernst Berg</dc:creator>
		<pubDate>Wed, 09 Feb 2011 11:44:46 +0000</pubDate>
		<guid isPermaLink="false">http://jpcameron.com/blog/?p=47#comment-260</guid>
		<description>I was just Googling and saw this.

I too was fascinated by the 3x+1,x/2 and have written programs to use this.
My point of view was &quot;it seems to work all the time so trust it.&quot;
Anyway it&#039;s been a dependable system.

I wanted to share what I know from exploring the 3x+1,x/2 form and I personally use notation of brackets [] to denote a cycle.  so [3x+1,x/2] 
For the 3 of 3x+1 we can say A so Ax+1,x/2 or Ax(+ or - ) y , x mod z
For all y that is a power of three there is one attractor for all input so 3x+3,x/2 will cycle 12,6,3.. and similar for all powers of three for Y of [Ax+/-y,xmodz] 

Another thing that seems to be real is the idea of a cycle of values. The term Ring is already established as a proper math term so I will call it a ring as in a cycle.
We all know the 4,2,1,4,2,1 of 3x+1 so it is a cycle of three or a ring size of three. That is how I am using the term ring here.
 Now since a system like 3x+5,x/2 has:  Report for 3(x) + 5 Contains 6 Attractor(s) 1 19 5 23 187 347 I believe we are not looking at just 3x+1,x/2 but a larger family of systems and that family of systems has structure because it is obvious the attractors have relationships.

Proving 3x+1 means proving 3x+5 or y = 999999999999999.... for example.


Some attractors

Report for 3(x) + 1 Contains 1 Attractor(s)
1
----------------------------------------------
Report for 3(x) + 3 Contains 1 Attractor(s)
3
----------------------------------------------
Report for 3(x) + 5 Contains 6 Attractor(s)
1 19 5 23 187 347
----------------------------------------------
Report for 3(x) + 7 Contains 2 Attractor(s)
5 7
----------------------------------------------
Report for 3(x) + 9 Contains 1 Attractor(s)
9
----------------------------------------------
Report for 3(x) + 11 Contains 3 Attractor(s)
1 13 11
----------------------------------------------
Report for 3(x) + 13 Contains 10 Attractor(s)
1 13 131 211 259 227 287 251 283 319


Now I worked out one day that 3x+1 is one in a set of systems where 3x+1/x/2 was a part and it is based on the facts that if we express the process of any number in any [3x+y,x/2]we can write out the 3x part as one parity (&quot;1&quot;) and the x/2 as the other (&quot;0&quot;) in an even odd or binary string.
Then we can see that no two odd cycles ( if we represent 3x+y as a set or odd parity ) can be in a sequence sequentially because any 3x+y is followed by an x/2
so for the iterations of one cycle it is possible to have one of 2 outcomes 0 or 1.. In 2 iterations it is possible for 00,10,01 or three and in fact it is Fibonacci 
2,3,5,8,13,21...

The set of all functions is then  2/1,3/2,4/3,5/5,6,8,7/13... I don&#039;t know if &quot;all functions&quot; is appropriate I like to call it a Universe but I&#039;m not qualified to name things like that outside of personal labels.   
  All of these can be explored. I looked into [7x-1,x/13] and adding or subtracting the Y can have different effects in different systems for different values.
I don&#039;s see why more complex processing is not possible such as [3(x+7*12),x/2] or sum such thing that works.. I just typed that at random..
 What they all have in common is pattern. Look at these from the parity expression they make. I don&#039;t believe the point is the value of X it&#039;s the pattern of value processed. In fact I consider the function to be the thing moving not value but I have several points of view I visit on these types of things..

3/2 shows us in the form [3x+/-y,x/2] that the patterns follow Fibonacci counts but 4/3 is different using 00,01,10 and 11 in it&#039;s pattern. So too are 7/13 with long runs of one parity symbol before the other is seen and so on..  
 I figure there would be a practical use for generating patterns based on a single value for X. Proving them all is not on my todo list.  I have explored a few other than 3/2 system. 
Oh by the way if we want to generate a number that has over 1 billion iterations or more the &quot;Reverse Collatz&quot; I wrote can do that. It&#039;s a crude program but was my attempt to explore what creates a value of a specific distance or stopping time.
I was looking for the natural language behind it all. The truth is the landscape changes when the Y changes. I conjecture that no two systems for Y where Y1 != Y2 have the same structure.
Alright..  I stand by what I wrote and offer this post as a contribution.
I have web sites and forums so if there is any need to have a forum I can add it to sites I already have up and running.
 Currently I am working on the Million digit challenge and am finding the hard truth about data but I am not out of creative approaches yet.
 all in all I like exploring these kinds of things and I assume they can be called dynamic systems. The result isn&#039;t a number but a pattern from what I can tell.

Ernst
----
Well that&#039;s all good..  

I also have a rudimentary program that can grow values that will be close to the natural iterations needed to reach 1 in a simple attempt at reverse [3x+1,x/2]  

 So that is what i did.  I am open to discuss or share.

I was thinking that those cycles of value such as the 4,2,1 of [3x+1,x/2] may not be separate after all. Since non power of three Y values will have other than that Y in it&#039;s attractor list is it possible that some systems connect in some way to other systems?

Well I saw structure and pattern in the attractors and there was an upward growth in the maximum value needed to express all the instances of attractor for a given system.

So I know that 3x+1 is not alone nor will explaining what it is doing only cover 3x+1

In fact I think we are just looking at two functions that share a common element in a struggle between two systems of 3x and x/2.
We are the force that causes it to cycle by artificially cycling it when 1 is a power of 2 and an odd. We allow all powers of 2 to be divided but one other wise it would head off into infinity as an endless series of x/2.

However, since this seems so stable I have envisioned using values to create pattern that can be used is an intelligent system  perhaps in robotics where the functions of operations are defined by values but are visited by the current value of x in A(x)+/-Y,X/modZ] where A=3, Y=1 and Z = 2

Well That&#039;s the short of it..  I&#039;m available to share what I did so drop me a line if I can be of help ernst_Berg@Sbcglobal.net</description>
		<content:encoded><![CDATA[<p>I was just Googling and saw this.</p>
<p>I too was fascinated by the 3x+1,x/2 and have written programs to use this.<br />
My point of view was &#8220;it seems to work all the time so trust it.&#8221;<br />
Anyway it&#8217;s been a dependable system.</p>
<p>I wanted to share what I know from exploring the 3x+1,x/2 form and I personally use notation of brackets [] to denote a cycle.  so [3x+1,x/2]<br />
For the 3 of 3x+1 we can say A so Ax+1,x/2 or Ax(+ or &#8211; ) y , x mod z<br />
For all y that is a power of three there is one attractor for all input so 3x+3,x/2 will cycle 12,6,3.. and similar for all powers of three for Y of [Ax+/-y,xmodz] </p>
<p>Another thing that seems to be real is the idea of a cycle of values. The term Ring is already established as a proper math term so I will call it a ring as in a cycle.<br />
We all know the 4,2,1,4,2,1 of 3x+1 so it is a cycle of three or a ring size of three. That is how I am using the term ring here.<br />
 Now since a system like 3x+5,x/2 has:  Report for 3(x) + 5 Contains 6 Attractor(s) 1 19 5 23 187 347 I believe we are not looking at just 3x+1,x/2 but a larger family of systems and that family of systems has structure because it is obvious the attractors have relationships.</p>
<p>Proving 3x+1 means proving 3x+5 or y = 999999999999999&#8230;. for example.</p>
<p>Some attractors</p>
<p>Report for 3(x) + 1 Contains 1 Attractor(s)<br />
1<br />
&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-<br />
Report for 3(x) + 3 Contains 1 Attractor(s)<br />
3<br />
&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-<br />
Report for 3(x) + 5 Contains 6 Attractor(s)<br />
1 19 5 23 187 347<br />
&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-<br />
Report for 3(x) + 7 Contains 2 Attractor(s)<br />
5 7<br />
&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-<br />
Report for 3(x) + 9 Contains 1 Attractor(s)<br />
9<br />
&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-<br />
Report for 3(x) + 11 Contains 3 Attractor(s)<br />
1 13 11<br />
&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;&#8212;-<br />
Report for 3(x) + 13 Contains 10 Attractor(s)<br />
1 13 131 211 259 227 287 251 283 319</p>
<p>Now I worked out one day that 3x+1 is one in a set of systems where 3x+1/x/2 was a part and it is based on the facts that if we express the process of any number in any [3x+y,x/2]we can write out the 3x part as one parity (&#8220;1&#8243;) and the x/2 as the other (&#8220;0&#8243;) in an even odd or binary string.<br />
Then we can see that no two odd cycles ( if we represent 3x+y as a set or odd parity ) can be in a sequence sequentially because any 3x+y is followed by an x/2<br />
so for the iterations of one cycle it is possible to have one of 2 outcomes 0 or 1.. In 2 iterations it is possible for 00,10,01 or three and in fact it is Fibonacci<br />
2,3,5,8,13,21&#8230;</p>
<p>The set of all functions is then  2/1,3/2,4/3,5/5,6,8,7/13&#8230; I don&#8217;t know if &#8220;all functions&#8221; is appropriate I like to call it a Universe but I&#8217;m not qualified to name things like that outside of personal labels.<br />
  All of these can be explored. I looked into [7x-1,x/13] and adding or subtracting the Y can have different effects in different systems for different values.<br />
I don&#8217;s see why more complex processing is not possible such as [3(x+7*12),x/2] or sum such thing that works.. I just typed that at random..<br />
 What they all have in common is pattern. Look at these from the parity expression they make. I don&#8217;t believe the point is the value of X it&#8217;s the pattern of value processed. In fact I consider the function to be the thing moving not value but I have several points of view I visit on these types of things..</p>
<p>3/2 shows us in the form [3x+/-y,x/2] that the patterns follow Fibonacci counts but 4/3 is different using 00,01,10 and 11 in it&#8217;s pattern. So too are 7/13 with long runs of one parity symbol before the other is seen and so on..<br />
 I figure there would be a practical use for generating patterns based on a single value for X. Proving them all is not on my todo list.  I have explored a few other than 3/2 system.<br />
Oh by the way if we want to generate a number that has over 1 billion iterations or more the &#8220;Reverse Collatz&#8221; I wrote can do that. It&#8217;s a crude program but was my attempt to explore what creates a value of a specific distance or stopping time.<br />
I was looking for the natural language behind it all. The truth is the landscape changes when the Y changes. I conjecture that no two systems for Y where Y1 != Y2 have the same structure.<br />
Alright..  I stand by what I wrote and offer this post as a contribution.<br />
I have web sites and forums so if there is any need to have a forum I can add it to sites I already have up and running.<br />
 Currently I am working on the Million digit challenge and am finding the hard truth about data but I am not out of creative approaches yet.<br />
 all in all I like exploring these kinds of things and I assume they can be called dynamic systems. The result isn&#8217;t a number but a pattern from what I can tell.</p>
<p>Ernst<br />
&#8212;-<br />
Well that&#8217;s all good..  </p>
<p>I also have a rudimentary program that can grow values that will be close to the natural iterations needed to reach 1 in a simple attempt at reverse [3x+1,x/2]  </p>
<p> So that is what i did.  I am open to discuss or share.</p>
<p>I was thinking that those cycles of value such as the 4,2,1 of [3x+1,x/2] may not be separate after all. Since non power of three Y values will have other than that Y in it&#8217;s attractor list is it possible that some systems connect in some way to other systems?</p>
<p>Well I saw structure and pattern in the attractors and there was an upward growth in the maximum value needed to express all the instances of attractor for a given system.</p>
<p>So I know that 3x+1 is not alone nor will explaining what it is doing only cover 3x+1</p>
<p>In fact I think we are just looking at two functions that share a common element in a struggle between two systems of 3x and x/2.<br />
We are the force that causes it to cycle by artificially cycling it when 1 is a power of 2 and an odd. We allow all powers of 2 to be divided but one other wise it would head off into infinity as an endless series of x/2.</p>
<p>However, since this seems so stable I have envisioned using values to create pattern that can be used is an intelligent system  perhaps in robotics where the functions of operations are defined by values but are visited by the current value of x in A(x)+/-Y,X/modZ] where A=3, Y=1 and Z = 2</p>
<p>Well That&#8217;s the short of it..  I&#8217;m available to share what I did so drop me a line if I can be of help <a href="mailto:ernst_Berg@Sbcglobal.net">ernst_Berg@Sbcglobal.net</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: mathieu chenier</title>
		<link>http://jpcameron.com/blog/?p=47&#038;cpage=1#comment-257</link>
		<dc:creator>mathieu chenier</dc:creator>
		<pubDate>Sat, 29 Jan 2011 17:55:46 +0000</pubDate>
		<guid isPermaLink="false">http://jpcameron.com/blog/?p=47#comment-257</guid>
		<description>because all impair number additioned by 1 will lead to a number dividable by 2 ?</description>
		<content:encoded><![CDATA[<p>because all impair number additioned by 1 will lead to a number dividable by 2 ?</p>
]]></content:encoded>
	</item>
</channel>
</rss>
