<?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: Simons Lecture I: Structure and randomness in Fourier analysis and number theory</title>
	<atom:link href="http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/feed/" rel="self" type="application/rss+xml" />
	<link>http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/</link>
	<description>Updates on my research and expository papers, discussion of open problems, and other maths-related topics.  By Terence Tao</description>
	<lastBuildDate>Wed, 19 Jun 2013 17:10:35 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.com/</generator>
	<item>
		<title>By: The Beauty of Bounded Gaps &#124; sladisworld</title>
		<link>http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-230912</link>
		<dc:creator><![CDATA[The Beauty of Bounded Gaps &#124; sladisworld]]></dc:creator>
		<pubDate>Thu, 23 May 2013 14:18:37 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-230912</guid>
		<description><![CDATA[[&#8230;] (A few suggestions for further reading for those with more technical tastes: Number theorist Emmanuel Kowalski offers a first report on Zhang’s paper. And here’s Terry Tao on the dichotomy between structure and randomness.) [&#8230;]]]></description>
		<content:encoded><![CDATA[<p>[&#8230;] (A few suggestions for further reading for those with more technical tastes: Number theorist Emmanuel Kowalski offers a first report on Zhang’s paper. And here’s Terry Tao on the dichotomy between structure and randomness.) [&#8230;]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: E.L. Wisty</title>
		<link>http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-229614</link>
		<dc:creator><![CDATA[E.L. Wisty]]></dc:creator>
		<pubDate>Thu, 16 May 2013 09:49:31 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-229614</guid>
		<description><![CDATA[Reblogged this on &lt;a href=&quot;http://jsandber.wordpress.com/2013/05/16/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/&quot; rel=&quot;nofollow&quot;&gt;Pink Iguana&lt;/a&gt; and commented: 
Look up Simons lectures and David Donoho]]></description>
		<content:encoded><![CDATA[<p>Reblogged this on <a href="http://jsandber.wordpress.com/2013/05/16/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/" rel="nofollow">Pink Iguana</a> and commented:<br />
Look up Simons lectures and David Donoho</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Hugh</title>
		<link>http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-49531</link>
		<dc:creator><![CDATA[Hugh]]></dc:creator>
		<pubDate>Tue, 11 Jan 2011 13:35:51 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-49531</guid>
		<description><![CDATA[My attempt at a twin prime proof, for anyone who is interested... 

http://barkerhugh.blogspot.com/2011/01/twin-prime-proof-compressed-version.html]]></description>
		<content:encoded><![CDATA[<p>My attempt at a twin prime proof, for anyone who is interested&#8230; </p>
<p><a href="http://barkerhugh.blogspot.com/2011/01/twin-prime-proof-compressed-version.html" rel="nofollow">http://barkerhugh.blogspot.com/2011/01/twin-prime-proof-compressed-version.html</a></p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Arnie Dris</title>
		<link>http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-47897</link>
		<dc:creator><![CDATA[Arnie Dris]]></dc:creator>
		<pubDate>Fri, 29 Oct 2010 05:29:32 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-47897</guid>
		<description><![CDATA[Dear Professor Tao,

I have some number-theoretic investigations going on at http://arnienumbers.blogspot.com.  (e.g. the last 3 blog posts)

Please do take a look when you get the time.

Cheers,
Arnie]]></description>
		<content:encoded><![CDATA[<p>Dear Professor Tao,</p>
<p>I have some number-theoretic investigations going on at <a href="http://arnienumbers.blogspot.com" rel="nofollow">http://arnienumbers.blogspot.com</a>.  (e.g. the last 3 blog posts)</p>
<p>Please do take a look when you get the time.</p>
<p>Cheers,<br />
Arnie</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Terence Tao</title>
		<link>http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-46776</link>
		<dc:creator><![CDATA[Terence Tao]]></dc:creator>
		<pubDate>Fri, 03 Sep 2010 17:59:48 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-46776</guid>
		<description><![CDATA[2 and 3 are the only primes that are not adjacent to a multiple of six.  Note that the converse statement (all numbers adjacent to a multiple of six are prime) is certainly false, with 25 being the first counterexample.]]></description>
		<content:encoded><![CDATA[<p>2 and 3 are the only primes that are not adjacent to a multiple of six.  Note that the converse statement (all numbers adjacent to a multiple of six are prime) is certainly false, with 25 being the first counterexample.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Ana</title>
		<link>http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-46774</link>
		<dc:creator><![CDATA[Ana]]></dc:creator>
		<pubDate>Fri, 03 Sep 2010 15:55:43 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-46774</guid>
		<description><![CDATA[As stated above: Primes are all adjacent to a multiple of six (with two exceptions). I found that one is for n=20. What is the other exception?]]></description>
		<content:encoded><![CDATA[<p>As stated above: Primes are all adjacent to a multiple of six (with two exceptions). I found that one is for n=20. What is the other exception?</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Math/Stat</title>
		<link>http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-43636</link>
		<dc:creator><![CDATA[Math/Stat]]></dc:creator>
		<pubDate>Mon, 15 Feb 2010 21:58:30 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-43636</guid>
		<description><![CDATA[[...] (about string theory and enumerative geometry), the Szemeredi  Festival (where we went through Terry Tao&#8217;s The Dichotomy between Structure and Randomness, Arithmetic Progression, and the Primes), [...]]]></description>
		<content:encoded><![CDATA[<p>[...] (about string theory and enumerative geometry), the Szemeredi  Festival (where we went through Terry Tao&#8217;s The Dichotomy between Structure and Randomness, Arithmetic Progression, and the Primes), [...]</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Dan</title>
		<link>http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-42721</link>
		<dc:creator><![CDATA[Dan]]></dc:creator>
		<pubDate>Sun, 06 Dec 2009 21:16:52 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-42721</guid>
		<description><![CDATA[Primes do have a distributive pattern althought very complex they 
are associated with Mercenne triangle numbers and all 2^n and the
Fermat triangle numbers in a unique way as you will see below! 

My studies of triangle number factoring where the addition and negation
of this series below produces no primes.

Except for the very beginning of this summation and negation there is an
actual pattern that can be observed disproving any sort of randomness
or psudo randomness to the primes.

9+3+2+1
+3+2
-2
+4+3+2
-6
+5+4+3+2 
-11
+6+5+4+3+2
-17
+7+6+5+4+3+2
-24
+8+7+6+5+4+3+2
-32 
+9+8+7+6+5+4+3+2
-41
+10+9+8+7+6+5+4+3+2
-51
+11+10+9+8+7+6+5+4+3+2
-62
...
You will note the negation is predicated on a natural progression
after each set of summations and negation of just (3) from the previous
set of summations and negation. After the negation the value will 
allways be congruent to 0(mod 3). 

This simple series does not produce any primes but does produce
all odd composites and even integers except for the special even 
integers below.

A few even integer exceptions also are not produced such as --
Where n = 1,2,3,4..n then all 2^n are not produced.
Also all even Mercenne triangle numbers-- 
6,28,496,8128.. are not produced. Also known as even perfect numbers.

Also not produced are all even Fermat triangle numbers of the form --
When n&gt;1 then ((2^(2^n)) +1)= prime  then --
when n = 2,4,8,16 then Fermat t(n) = (2^(n-1))*(2^n)+1)  =
10,136,32896,2147516416

There are other integers other than primes as I show above that are 
not produced  but they are all even or prime (2). So Just observing all 
odd integer only odd composites are produced in the above sumations 
and negations.   

The primes  shurely have a complex distribution but still a complex
ordered  distribution by not appearing in the above summations and
negations.

Taking all integers that are not produced as being the primes and the special cases of the other even integers that also do not get produced
from this summation and negation sequence, is there a orderly reversal 
of my sum and negation that will produce the primes and all the special
evens that are associated with the primes?

It would make the case for the not so complex distribution of the primes.   
  
Dan]]></description>
		<content:encoded><![CDATA[<p>Primes do have a distributive pattern althought very complex they<br />
are associated with Mercenne triangle numbers and all 2^n and the<br />
Fermat triangle numbers in a unique way as you will see below! </p>
<p>My studies of triangle number factoring where the addition and negation<br />
of this series below produces no primes.</p>
<p>Except for the very beginning of this summation and negation there is an<br />
actual pattern that can be observed disproving any sort of randomness<br />
or psudo randomness to the primes.</p>
<p>9+3+2+1<br />
+3+2<br />
-2<br />
+4+3+2<br />
-6<br />
+5+4+3+2<br />
-11<br />
+6+5+4+3+2<br />
-17<br />
+7+6+5+4+3+2<br />
-24<br />
+8+7+6+5+4+3+2<br />
-32<br />
+9+8+7+6+5+4+3+2<br />
-41<br />
+10+9+8+7+6+5+4+3+2<br />
-51<br />
+11+10+9+8+7+6+5+4+3+2<br />
-62<br />
&#8230;<br />
You will note the negation is predicated on a natural progression<br />
after each set of summations and negation of just (3) from the previous<br />
set of summations and negation. After the negation the value will<br />
allways be congruent to 0(mod 3). </p>
<p>This simple series does not produce any primes but does produce<br />
all odd composites and even integers except for the special even<br />
integers below.</p>
<p>A few even integer exceptions also are not produced such as &#8211;<br />
Where n = 1,2,3,4..n then all 2^n are not produced.<br />
Also all even Mercenne triangle numbers&#8211;<br />
6,28,496,8128.. are not produced. Also known as even perfect numbers.</p>
<p>Also not produced are all even Fermat triangle numbers of the form &#8211;<br />
When n&gt;1 then ((2^(2^n)) +1)= prime  then &#8211;<br />
when n = 2,4,8,16 then Fermat t(n) = (2^(n-1))*(2^n)+1)  =<br />
10,136,32896,2147516416</p>
<p>There are other integers other than primes as I show above that are<br />
not produced  but they are all even or prime (2). So Just observing all<br />
odd integer only odd composites are produced in the above sumations<br />
and negations.   </p>
<p>The primes  shurely have a complex distribution but still a complex<br />
ordered  distribution by not appearing in the above summations and<br />
negations.</p>
<p>Taking all integers that are not produced as being the primes and the special cases of the other even integers that also do not get produced<br />
from this summation and negation sequence, is there a orderly reversal<br />
of my sum and negation that will produce the primes and all the special<br />
evens that are associated with the primes?</p>
<p>It would make the case for the not so complex distribution of the primes.   </p>
<p>Dan</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: AJ</title>
		<link>http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-42652</link>
		<dc:creator><![CDATA[AJ]]></dc:creator>
		<pubDate>Wed, 02 Dec 2009 22:55:44 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-42652</guid>
		<description><![CDATA[Professor Tao:
I think your explanation assumes &quot;the universe&quot; as a mathematical object is representable.]]></description>
		<content:encoded><![CDATA[<p>Professor Tao:<br />
I think your explanation assumes &#8220;the universe&#8221; as a mathematical object is representable.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Structure and Randomness: Pages from Year One of a Mathematical Blog &#171; Abner&#8217;s Postgraduate Days</title>
		<link>http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-39102</link>
		<dc:creator><![CDATA[Structure and Randomness: Pages from Year One of a Mathematical Blog &#171; Abner&#8217;s Postgraduate Days]]></dc:creator>
		<pubDate>Sat, 30 May 2009 21:55:08 +0000</pubDate>
		<guid isPermaLink="false">http://terrytao.wordpress.com/2007/04/05/simons-lecture-i-structure-and-randomness-in-fourier-analysis-and-number-theory/#comment-39102</guid>
		<description><![CDATA[[...] Simons Lecture I: Structure and randomness in Fourier analysis and number theory For instance, from the Siegel-Walfisz theorem we know that the last digit of large prime numbers is uniformly distributed in the set {1,3,7,9}; thus, if N is a large integer, the number of primes less than N ending in (say) 3, divided by the total number of primes less than N, is known to converge to 1/4 in the limit as N goes to infinity. Fourier analysis is an essential feature of many of these problems from the perspective of the dichotomy between structure and randomness, and in particular viewing structure as an obstruction to computing statistics which needs to be understood before the statistic can be accurately computed. [...]]]></description>
		<content:encoded><![CDATA[<p>[...] Simons Lecture I: Structure and randomness in Fourier analysis and number theory For instance, from the Siegel-Walfisz theorem we know that the last digit of large prime numbers is uniformly distributed in the set {1,3,7,9}; thus, if N is a large integer, the number of primes less than N ending in (say) 3, divided by the total number of primes less than N, is known to converge to 1/4 in the limit as N goes to infinity. Fourier analysis is an essential feature of many of these problems from the perspective of the dichotomy between structure and randomness, and in particular viewing structure as an obstruction to computing statistics which needs to be understood before the statistic can be accurately computed. [...]</p>
]]></content:encoded>
	</item>
</channel>
</rss>
