<?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/"
	xmlns:georss="http://www.georss.org/georss" xmlns:geo="http://www.w3.org/2003/01/geo/wgs84_pos#" xmlns:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments on: The Collatz conjecture, Littlewood-Offord theory, and powers of 2 and 3</title>
	<atom:link href="http://terrytao.wordpress.com/2011/08/25/the-collatz-conjecture-littlewood-offord-theory-and-powers-of-2-and-3/feed/" rel="self" type="application/rss+xml" />
	<link>http://terrytao.wordpress.com/2011/08/25/the-collatz-conjecture-littlewood-offord-theory-and-powers-of-2-and-3/</link>
	<description>Updates on my research and expository papers, discussion of open problems, and other maths-related topics.  By Terence Tao</description>
	<lastBuildDate>Sun, 19 May 2013 17:23:09 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: vznvzn</title>
		<link>http://terrytao.wordpress.com/2011/08/25/the-collatz-conjecture-littlewood-offord-theory-and-powers-of-2-and-3/#comment-229156</link>
		<dc:creator><![CDATA[vznvzn]]></dc:creator>
		<pubDate>Mon, 13 May 2013 21:58:41 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5081#comment-229156</guid>
		<description><![CDATA[hi all great to see the intense enthusiasm for the problem here. here is a &lt;a href=&quot;http://vzn1.wordpress.com/code/collatz-conjecture-experiments/&quot; rel=&quot;nofollow&quot;&gt;brief writeup&lt;/a&gt; on my &lt;a href=&quot;http://vzn1.wordpress.com/&quot; rel=&quot;nofollow&quot;&gt;Turing machine blog&lt;/a&gt; of an approach based on a real FSM (finite state machine) transducer constructed for iterates (briefly mentioned but not given in the &lt;a href=&quot;http://en.wikipedia.org/wiki/Collatz_conjecture#As_an_abstract_machine_that_computes_in_base_two&quot; rel=&quot;nofollow&quot;&gt;wikipedia article&gt;&lt;/a&gt;) which also has a close connection to an old paper by Shallit/Wilson on its relation to regular languages. its also ruby &quot;tool box&quot; code for experimenting with different enumeration orders that might be helpful for finding an inductive structure/proof. it also cites Sinyor&#039;s paper as a very &quot;nearby&quot; approach. hope to chat with anyone on the subj &amp; interested in experimental/computational approaches to &amp; attacks on the problem via comments etc.]]></description>
		<content:encoded><![CDATA[<p>hi all great to see the intense enthusiasm for the problem here. here is a <a href="http://vzn1.wordpress.com/code/collatz-conjecture-experiments/" rel="nofollow">brief writeup</a> on my <a href="http://vzn1.wordpress.com/" rel="nofollow">Turing machine blog</a> of an approach based on a real FSM (finite state machine) transducer constructed for iterates (briefly mentioned but not given in the <a href="http://en.wikipedia.org/wiki/Collatz_conjecture#As_an_abstract_machine_that_computes_in_base_two" rel="nofollow">wikipedia article&gt;</a>) which also has a close connection to an old paper by Shallit/Wilson on its relation to regular languages. its also ruby &#8220;tool box&#8221; code for experimenting with different enumeration orders that might be helpful for finding an inductive structure/proof. it also cites Sinyor&#8217;s paper as a very &#8220;nearby&#8221; approach. hope to chat with anyone on the subj &amp; interested in experimental/computational approaches to &amp; attacks on the problem via comments etc.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous</title>
		<link>http://terrytao.wordpress.com/2011/08/25/the-collatz-conjecture-littlewood-offord-theory-and-powers-of-2-and-3/#comment-215523</link>
		<dc:creator><![CDATA[Anonymous]]></dc:creator>
		<pubDate>Sat, 02 Feb 2013 15:08:56 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5081#comment-215523</guid>
		<description><![CDATA[how could it not be linear when the entire equation and operations is linear? slopes up (3n+1) and comes back down with slope 0(N/2).

N/4 is touchable for sure but you just need to look at one very particular string of odd numbers. this particular string of odd numbers to be exact 1+8n for all N. ex. 1,9,17,......

ill even make it easier for you with a simple proposition.

3(1 + 8N) +1 = (1 + 6M) 2^2 iff N is any Natural number and M is dependent on N. meaning there is only one M for each N.]]></description>
		<content:encoded><![CDATA[<p>how could it not be linear when the entire equation and operations is linear? slopes up (3n+1) and comes back down with slope 0(N/2).</p>
<p>N/4 is touchable for sure but you just need to look at one very particular string of odd numbers. this particular string of odd numbers to be exact 1+8n for all N. ex. 1,9,17,&#8230;&#8230;</p>
<p>ill even make it easier for you with a simple proposition.</p>
<p>3(1 + 8N) +1 = (1 + 6M) 2^2 iff N is any Natural number and M is dependent on N. meaning there is only one M for each N.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Huenyk</title>
		<link>http://terrytao.wordpress.com/2011/08/25/the-collatz-conjecture-littlewood-offord-theory-and-powers-of-2-and-3/#comment-215502</link>
		<dc:creator><![CDATA[Huenyk]]></dc:creator>
		<pubDate>Sat, 02 Feb 2013 10:09:06 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5081#comment-215502</guid>
		<description><![CDATA[I am a control system engineer.  3n+1 problem has attracted my attention as a controller tuning problem for stability to 1.  After one month, I give up for good. The reason is that n/2 cannot be touched.  You can&#039;t go to n/4.  3n+1 can be finely tuned to either 3n+3 or 3n-1 both of which are nonconvergent.  This is a highly nonlinear control system.  As a control engineer I give up. But number theorists don&#039;t know that.  So they plod on!
HuenYK (dr)
cosmolog92@gmail.com]]></description>
		<content:encoded><![CDATA[<p>I am a control system engineer.  3n+1 problem has attracted my attention as a controller tuning problem for stability to 1.  After one month, I give up for good. The reason is that n/2 cannot be touched.  You can&#8217;t go to n/4.  3n+1 can be finely tuned to either 3n+3 or 3n-1 both of which are nonconvergent.  This is a highly nonlinear control system.  As a control engineer I give up. But number theorists don&#8217;t know that.  So they plod on!<br />
HuenYK (dr)<br />
<a href="mailto:cosmolog92@gmail.com">cosmolog92@gmail.com</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous</title>
		<link>http://terrytao.wordpress.com/2011/08/25/the-collatz-conjecture-littlewood-offord-theory-and-powers-of-2-and-3/#comment-214893</link>
		<dc:creator><![CDATA[Anonymous]]></dc:creator>
		<pubDate>Mon, 28 Jan 2013 15:20:39 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5081#comment-214893</guid>
		<description><![CDATA[The result of Krasikov and Lagarias, world record five in Lagarias&#039;s 2010 book, does not have a rigorous proof: and therefor is unessecery for anything.]]></description>
		<content:encoded><![CDATA[<p>The result of Krasikov and Lagarias, world record five in Lagarias&#8217;s 2010 book, does not have a rigorous proof: and therefor is unessecery for anything.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Chris Bernardini</title>
		<link>http://terrytao.wordpress.com/2011/08/25/the-collatz-conjecture-littlewood-offord-theory-and-powers-of-2-and-3/#comment-211140</link>
		<dc:creator><![CDATA[Chris Bernardini]]></dc:creator>
		<pubDate>Fri, 28 Dec 2012 03:32:49 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5081#comment-211140</guid>
		<description><![CDATA[there are simple ways to turn an odd into is set and its cardinality very simply. i left this out simply due to laziness. but the method is whether or not you have to add 2 or subract two from it to make it divisbile by 3 and that tells you which set and then you simply divide that value that is divisible by 3 and thats N&#039;s cardinality in that set. for the set X they are all the odds divisible by three and u just divide by 3 to get their cardinality although that set is completely unessecary for anything.]]></description>
		<content:encoded><![CDATA[<p>there are simple ways to turn an odd into is set and its cardinality very simply. i left this out simply due to laziness. but the method is whether or not you have to add 2 or subract two from it to make it divisbile by 3 and that tells you which set and then you simply divide that value that is divisible by 3 and thats N&#8217;s cardinality in that set. for the set X they are all the odds divisible by three and u just divide by 3 to get their cardinality although that set is completely unessecary for anything.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Chris Bernardini</title>
		<link>http://terrytao.wordpress.com/2011/08/25/the-collatz-conjecture-littlewood-offord-theory-and-powers-of-2-and-3/#comment-211137</link>
		<dc:creator><![CDATA[Chris Bernardini]]></dc:creator>
		<pubDate>Fri, 28 Dec 2012 03:28:55 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5081#comment-211137</guid>
		<description><![CDATA[the sets of odd numbers are three infinite and one finite sets that separate all odd N. they are based on cardinality and in order to keep it simpler i will only state cardinality in these definitions because we already know what these mapping of values to the set of all N entails and their true meaning.

Set X = Odds 2,5,8,11,14,17,....etc.....infinity

Set - = odds 3,6,9,12,15,18,...etc....infinity

Set + = Odds 4,7,10,13,16,....etc.....infinity

Set ???? = 1 and ONLY 1.

now the true point of these set designations is this. due to prime factorization and the fact that every odd number is factorized by a unique set of odd prime factors and all evens are just adding a string of multiplications of 2s on each unique odd numbers factorization. essentially what I&#039;m saying is every even integer is composed of an odd base and multiplication of a string of 2&#039;s that each even number has a particular unique number of 2s In its factorization and all even numbers if stripped of 2s will descend to a particular odd number and that number as well as the movements leading to that number are predetermined because due to he rules every number can ONLY move one preset direction. a few rules involving these sets are this

if any element of set X has ANY amount of 2&#039;s in is prime factorization no whole positive odd integer X can ever equal that value as a result of (X*3)+1

if any element of set - has any odd number of 2&#039;s in its prime factorization then One and only one X will satisfy for  X*3+1. that value is predetermined in the following ways.

if an element of set - is multiplied by 2^1 then the value that produces that even as an odd within the collatz system is the element of -&#039;s actual numerical value minus its cardinality within set - multiplied by 2. for 5 which is the first element of this set it would be for example 5 - 2*1 and the next number in set x is 11 and the value that creates it times 2 is 11 - 2*2 and so on so forth into infinity.

the other infinite set + acts directly parallel to set - except that it does this by adding its cardinality multiplied by 2 instead of subtracting. also where for set - all of the odd numbers of twos in is prime factorization gets switched with evens for this one. and the minimal case where the producing value is directly related to the odd is that odd multiplied by 4 for example 7 is the first number in this set and 7 *4 is equal to (7+(2*1)*3+1 and 13 which is the second number in this set times 4 is equal to 13+(2*2)*3+1

this is for the most part everything involving how to split up and see the predictable nature. but one will notice that logically it seems that you could have 1 be part of set + based on the progression of those numbers. BUT it cannot for it would throw off every other numbers cardinality and causes 1 to be left alone as 1 *4 = 1*3(+1) and is the only number that causes a number hat breaks down to itself on immediate removal of all 2&#039;s on successive division of two.

also for all Odds numbers X. if X * 2^n = n*3+1 then X*2^n+2 = n*4+1 or n+x*2^n both of these give the exact same values.

also another reason 1 mus be in a set of itself is another way of splitting odds hat requires it to be so. it basically falls on my concept of the way a number must move is a transform stage. so in my notation for this part x-----&gt;y means that X becomes Y under all circumstances and Xx then x------&gt;1.

if element of set E------&gt;X then X---------&gt;Y and y is always Greater than E for ALL E&#039;s

if element of set O----------&gt;X then X-----------Y and y is always less than E for all E&#039;s

also if N---------&gt;X--------------&gt;Y if N is any odd Y will be odd and NO Y will EVER be an Element of set X from the previous groups.(no number divisible by 3 will occur as Y and if y--------&gt;z-------&gt;f,,,, so on so forth and no number will ever be divisible by 3 after a value divisible by three has occurred.

this last part is the one area i haven&#039;t gone too much into. I&#039;m sure there might be a real rule that pinpoints exactly how much larger or smaller a number will be on second transform but i haven&#039;t really felt like going into this any further as i am currently working on a new problem. Hopefully this gives news answers and may be the part needed to prove this &quot;Hard&quot; problem. i just think its more absurd to think any other number would cause a cycle based on the two different clearly explained reasons why one causes an exception when working with the set of all odd numbers.]]></description>
		<content:encoded><![CDATA[<p>the sets of odd numbers are three infinite and one finite sets that separate all odd N. they are based on cardinality and in order to keep it simpler i will only state cardinality in these definitions because we already know what these mapping of values to the set of all N entails and their true meaning.</p>
<p>Set X = Odds 2,5,8,11,14,17,&#8230;.etc&#8230;..infinity</p>
<p>Set &#8211; = odds 3,6,9,12,15,18,&#8230;etc&#8230;.infinity</p>
<p>Set + = Odds 4,7,10,13,16,&#8230;.etc&#8230;..infinity</p>
<p>Set ???? = 1 and ONLY 1.</p>
<p>now the true point of these set designations is this. due to prime factorization and the fact that every odd number is factorized by a unique set of odd prime factors and all evens are just adding a string of multiplications of 2s on each unique odd numbers factorization. essentially what I&#8217;m saying is every even integer is composed of an odd base and multiplication of a string of 2&#8242;s that each even number has a particular unique number of 2s In its factorization and all even numbers if stripped of 2s will descend to a particular odd number and that number as well as the movements leading to that number are predetermined because due to he rules every number can ONLY move one preset direction. a few rules involving these sets are this</p>
<p>if any element of set X has ANY amount of 2&#8242;s in is prime factorization no whole positive odd integer X can ever equal that value as a result of (X*3)+1</p>
<p>if any element of set &#8211; has any odd number of 2&#8242;s in its prime factorization then One and only one X will satisfy for  X*3+1. that value is predetermined in the following ways.</p>
<p>if an element of set &#8211; is multiplied by 2^1 then the value that produces that even as an odd within the collatz system is the element of -&#8217;s actual numerical value minus its cardinality within set &#8211; multiplied by 2. for 5 which is the first element of this set it would be for example 5 &#8211; 2*1 and the next number in set x is 11 and the value that creates it times 2 is 11 &#8211; 2*2 and so on so forth into infinity.</p>
<p>the other infinite set + acts directly parallel to set &#8211; except that it does this by adding its cardinality multiplied by 2 instead of subtracting. also where for set &#8211; all of the odd numbers of twos in is prime factorization gets switched with evens for this one. and the minimal case where the producing value is directly related to the odd is that odd multiplied by 4 for example 7 is the first number in this set and 7 *4 is equal to (7+(2*1)*3+1 and 13 which is the second number in this set times 4 is equal to 13+(2*2)*3+1</p>
<p>this is for the most part everything involving how to split up and see the predictable nature. but one will notice that logically it seems that you could have 1 be part of set + based on the progression of those numbers. BUT it cannot for it would throw off every other numbers cardinality and causes 1 to be left alone as 1 *4 = 1*3(+1) and is the only number that causes a number hat breaks down to itself on immediate removal of all 2&#8242;s on successive division of two.</p>
<p>also for all Odds numbers X. if X * 2^n = n*3+1 then X*2^n+2 = n*4+1 or n+x*2^n both of these give the exact same values.</p>
<p>also another reason 1 mus be in a set of itself is another way of splitting odds hat requires it to be so. it basically falls on my concept of the way a number must move is a transform stage. so in my notation for this part x&#8212;&#8211;&gt;y means that X becomes Y under all circumstances and Xx then x&#8212;&#8212;&gt;1.</p>
<p>if element of set E&#8212;&#8212;&gt;X then X&#8212;&#8212;&#8212;&gt;Y and y is always Greater than E for ALL E&#8217;s</p>
<p>if element of set O&#8212;&#8212;&#8212;-&gt;X then X&#8212;&#8212;&#8212;&#8211;Y and y is always less than E for all E&#8217;s</p>
<p>also if N&#8212;&#8212;&#8212;&gt;X&#8212;&#8212;&#8212;&#8212;&#8211;&gt;Y if N is any odd Y will be odd and NO Y will EVER be an Element of set X from the previous groups.(no number divisible by 3 will occur as Y and if y&#8212;&#8212;&#8211;&gt;z&#8212;&#8212;-&gt;f,,,, so on so forth and no number will ever be divisible by 3 after a value divisible by three has occurred.</p>
<p>this last part is the one area i haven&#8217;t gone too much into. I&#8217;m sure there might be a real rule that pinpoints exactly how much larger or smaller a number will be on second transform but i haven&#8217;t really felt like going into this any further as i am currently working on a new problem. Hopefully this gives news answers and may be the part needed to prove this &#8220;Hard&#8221; problem. i just think its more absurd to think any other number would cause a cycle based on the two different clearly explained reasons why one causes an exception when working with the set of all odd numbers.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Anonymous</title>
		<link>http://terrytao.wordpress.com/2011/08/25/the-collatz-conjecture-littlewood-offord-theory-and-powers-of-2-and-3/#comment-171788</link>
		<dc:creator><![CDATA[Anonymous]]></dc:creator>
		<pubDate>Mon, 17 Sep 2012 16:30:06 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5081#comment-171788</guid>
		<description><![CDATA[Hello! Would you know please, which journal would be appropriate to submit to an article on this subject? Thanks for helping me]]></description>
		<content:encoded><![CDATA[<p>Hello! Would you know please, which journal would be appropriate to submit to an article on this subject? Thanks for helping me</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Marie Gaudin</title>
		<link>http://terrytao.wordpress.com/2011/08/25/the-collatz-conjecture-littlewood-offord-theory-and-powers-of-2-and-3/#comment-171747</link>
		<dc:creator><![CDATA[Marie Gaudin]]></dc:creator>
		<pubDate>Mon, 17 Sep 2012 14:58:20 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5081#comment-171747</guid>
		<description><![CDATA[Hello, my father has done a very hard work on this theme. He is looking for someone to read and appreciate his work (in french).Marie]]></description>
		<content:encoded><![CDATA[<p>Hello, my father has done a very hard work on this theme. He is looking for someone to read and appreciate his work (in french).Marie</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: April Nicole</title>
		<link>http://terrytao.wordpress.com/2011/08/25/the-collatz-conjecture-littlewood-offord-theory-and-powers-of-2-and-3/#comment-170738</link>
		<dc:creator><![CDATA[April Nicole]]></dc:creator>
		<pubDate>Fri, 14 Sep 2012 18:24:15 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5081#comment-170738</guid>
		<description><![CDATA[Basically, if you add 1 to every odd number, you get an even number. you dont even have to multiply by three. The equation is the same and can be stated many different ways with the same result. If even divide by two, if odd just add 1. If you can prove any odd number plus 1 = an even number, you have essentially proven the Collatz conjecture.]]></description>
		<content:encoded><![CDATA[<p>Basically, if you add 1 to every odd number, you get an even number. you dont even have to multiply by three. The equation is the same and can be stated many different ways with the same result. If even divide by two, if odd just add 1. If you can prove any odd number plus 1 = an even number, you have essentially proven the Collatz conjecture.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: leszek3</title>
		<link>http://terrytao.wordpress.com/2011/08/25/the-collatz-conjecture-littlewood-offord-theory-and-powers-of-2-and-3/#comment-142050</link>
		<dc:creator><![CDATA[leszek3]]></dc:creator>
		<pubDate>Tue, 08 May 2012 09:53:37 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/?p=5081#comment-142050</guid>
		<description><![CDATA[Thank You very much.]]></description>
		<content:encoded><![CDATA[<p>Thank You very much.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
