The Riemann zeta function and tuning: Difference between revisions

Line 1:

<h2>IMPORTED REVISION FROM WIKISPACES</h2>

This is an imported revision from Wikispaces. The revision metadata is included below for reference:<br>

: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2012-01-02 22:12:08 UTC</tt>.<br>

: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2012-01-02 22:15:09 UTC</tt>.<br>

: The original revision id was <tt>~~289167491~~</tt>.<br>

: The original revision id was <tt>289167861</tt>.<br>

: The revision comment was: <tt></tt><br>

The revision contents are below, presented both in the original Wikispaces Wikitext format, and in HTML exactly as Wikispaces rendered it.<br>

Line 25:

[[math]]

If s is greater than one, this does converge. However, we might want to make a few adjustments. For one thing, if the error is low enough that the tuning is consistent, then the error of the square of a prime is twice that of the prime, of the cube tripled, and so forth until the error becomes inconsistent. When the weighting uses logarithms and error measures are consistent, then the logarithmic weighting cancels this effect out, so we might consider that prime powers were implicitly included in the Tenney-Euclidean measure. We can go ahead and include them by adding a factor of 1/n for each prime power p^n. A somewhat peculiar but useful way to write the result of doing this is in terms of the [[http://en.wikipedia.org/wiki/Von_Mangoldt_function|Von Mangoldt function]], an [[http://en.wikipedia.org/wiki/Arithmetic_function|arithmetic function]] on positive integers which is equal to ln p on prime powers p^n, and is zero elsewhere. This is written using a capital lambda, and in terms of it we can include prime powers in our error function as

If s is greater than one, this does converge. However, we might want to make a few adjustments. For one thing, if the error is low enough that the tuning is consistent, then the error of the square of a prime is twice that of the prime, of the cube tripled, and so forth until the error becomes inconsistent. When the weighting uses logarithms and error measures are consistent, then the logarithmic weighting cancels this effect out, so we might consider that prime powers were implicitly included in the Tenney-Euclidean measure. We can go ahead and include them by adding a factor of 1/n for each prime power p^n. A somewhat peculiar but useful way to write the result of doing this is in terms of the [[http://en.wikipedia.org/wiki/Von_Mangoldt_function|Von Mangoldt function]], an [[http://en.wikipedia.org/wiki/Arithmetic_function|arithmetic function]] on positive integers which is equal to ln p on prime powers p^n, and is zero elsewhere. This is written using a capital lambda, as Λ(n), and in terms of it we can include prime powers in our error function as

[[math]]

Line 176:

--><script type="math/tex">\sum_2^\infty \frac{\|x \log_2 q\|^2}{q^s}</script><br />

<br />

If s is greater than one, this does converge. However, we might want to make a few adjustments. For one thing, if the error is low enough that the tuning is consistent, then the error of the square of a prime is twice that of the prime, of the cube tripled, and so forth until the error becomes inconsistent. When the weighting uses logarithms and error measures are consistent, then the logarithmic weighting cancels this effect out, so we might consider that prime powers were implicitly included in the Tenney-Euclidean measure. We can go ahead and include them by adding a factor of 1/n for each prime power p^n. A somewhat peculiar but useful way to write the result of doing this is in terms of the <a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Von_Mangoldt_function" rel="nofollow">Von Mangoldt function</a>, an <a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Arithmetic_function" rel="nofollow">arithmetic function</a> on positive integers which is equal to ln p on prime powers p^n, and is zero elsewhere. This is written using a capital lambda, and in terms of it we can include prime powers in our error function as<br />

If s is greater than one, this does converge. However, we might want to make a few adjustments. For one thing, if the error is low enough that the tuning is consistent, then the error of the square of a prime is twice that of the prime, of the cube tripled, and so forth until the error becomes inconsistent. When the weighting uses logarithms and error measures are consistent, then the logarithmic weighting cancels this effect out, so we might consider that prime powers were implicitly included in the Tenney-Euclidean measure. We can go ahead and include them by adding a factor of 1/n for each prime power p^n. A somewhat peculiar but useful way to write the result of doing this is in terms of the <a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Von_Mangoldt_function" rel="nofollow">Von Mangoldt function</a>, an <a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Arithmetic_function" rel="nofollow">arithmetic function</a> on positive integers which is equal to ln p on prime powers p^n, and is zero elsewhere. This is written using a capital lambda, as Λ(n), and in terms of it we can include prime powers in our error function as<br />

<br />

<!-- ws:start:WikiTextMathRule:2:

@@ Line 1: / Line 1: @@
 <h2>IMPORTED REVISION FROM WIKISPACES</h2>
 This is an imported revision from Wikispaces. The revision metadata is included below for reference:<br>
-: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2012-01-02 22:12:08 UTC</tt>.<br>
+: This revision was by author [[User:genewardsmith|genewardsmith]] and made on <tt>2012-01-02 22:15:09 UTC</tt>.<br>
-: The original revision id was <tt>289167491</tt>.<br>
+: The original revision id was <tt>289167861</tt>.<br>
 : The revision comment was: <tt></tt><br>
 The revision contents are below, presented both in the original Wikispaces Wikitext format, and in HTML exactly as Wikispaces rendered it.<br>
@@ Line 25: / Line 25: @@
 [[math]]
-If s is greater than one, this does converge. However, we might want to make a few adjustments. For one thing, if the error is low enough that the tuning is consistent, then the error of the square of a prime is twice that of the prime, of the cube tripled, and so forth until the error becomes inconsistent. When the weighting uses logarithms and error measures are consistent, then the logarithmic weighting cancels this effect out, so we might consider that prime powers were implicitly included in the Tenney-Euclidean measure. We can go ahead and include them by adding a factor of 1/n for each prime power p^n. A somewhat peculiar but useful way to write the result of doing this is in terms of the [[http://en.wikipedia.org/wiki/Von_Mangoldt_function|Von Mangoldt function]], an [[http://en.wikipedia.org/wiki/Arithmetic_function|arithmetic function]] on positive integers which is equal to ln p on prime powers p^n, and is zero elsewhere. This is written using a capital lambda, and in terms of it we can include prime powers in our error function as
+If s is greater than one, this does converge. However, we might want to make a few adjustments. For one thing, if the error is low enough that the tuning is consistent, then the error of the square of a prime is twice that of the prime, of the cube tripled, and so forth until the error becomes inconsistent. When the weighting uses logarithms and error measures are consistent, then the logarithmic weighting cancels this effect out, so we might consider that prime powers were implicitly included in the Tenney-Euclidean measure. We can go ahead and include them by adding a factor of 1/n for each prime power p^n. A somewhat peculiar but useful way to write the result of doing this is in terms of the [[http://en.wikipedia.org/wiki/Von_Mangoldt_function|Von Mangoldt function]], an [[http://en.wikipedia.org/wiki/Arithmetic_function|arithmetic function]] on positive integers which is equal to ln p on prime powers p^n, and is zero elsewhere. This is written using a capital lambda, as Λ(n), and in terms of it we can include prime powers in our error function as
 [[math]]
@@ Line 176: / Line 176: @@
   --&gt;&lt;script type="math/tex"&gt;\sum_2^\infty \frac{\|x \log_2 q\|^2}{q^s}&lt;/script&gt;&lt;!-- ws:end:WikiTextMathRule:1 --&gt;&lt;br /&gt;
 &lt;br /&gt;
-If s is greater than one, this does converge. However, we might want to make a few adjustments. For one thing, if the error is low enough that the tuning is consistent, then the error of the square of a prime is twice that of the prime, of the cube tripled, and so forth until the error becomes inconsistent. When the weighting uses logarithms and error measures are consistent, then the logarithmic weighting cancels this effect out, so we might consider that prime powers were implicitly included in the Tenney-Euclidean measure. We can go ahead and include them by adding a factor of 1/n for each prime power p^n. A somewhat peculiar but useful way to write the result of doing this is in terms of the &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Von_Mangoldt_function" rel="nofollow"&gt;Von Mangoldt function&lt;/a&gt;, an &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Arithmetic_function" rel="nofollow"&gt;arithmetic function&lt;/a&gt; on positive integers which is equal to ln p on prime powers p^n, and is zero elsewhere. This is written using a capital lambda, and in terms of it we can include prime powers in our error function as&lt;br /&gt;
+If s is greater than one, this does converge. However, we might want to make a few adjustments. For one thing, if the error is low enough that the tuning is consistent, then the error of the square of a prime is twice that of the prime, of the cube tripled, and so forth until the error becomes inconsistent. When the weighting uses logarithms and error measures are consistent, then the logarithmic weighting cancels this effect out, so we might consider that prime powers were implicitly included in the Tenney-Euclidean measure. We can go ahead and include them by adding a factor of 1/n for each prime power p^n. A somewhat peculiar but useful way to write the result of doing this is in terms of the &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Von_Mangoldt_function" rel="nofollow"&gt;Von Mangoldt function&lt;/a&gt;, an &lt;a class="wiki_link_ext" href="http://en.wikipedia.org/wiki/Arithmetic_function" rel="nofollow"&gt;arithmetic function&lt;/a&gt; on positive integers which is equal to ln p on prime powers p^n, and is zero elsewhere. This is written using a capital lambda, as Λ(n), and in terms of it we can include prime powers in our error function as&lt;br /&gt;
 &lt;br /&gt;
 &lt;!-- ws:start:WikiTextMathRule:2: