inweb-bootstrap/docs/goldbach/S-sp.html

115 lines
8.2 KiB
HTML
Raw Normal View History

2020-04-12 16:24:23 +00:00
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
2020-04-21 16:55:17 +00:00
<title>Summing Primes</title>
2020-04-20 22:26:08 +00:00
<link href="../docs-assets/Breadcrumbs.css" rel="stylesheet" rev="stylesheet" type="text/css">
2020-04-12 16:24:23 +00:00
<meta name="viewport" content="width=device-width initial-scale=1">
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
<meta http-equiv="Content-Language" content="en-gb">
2020-04-20 22:26:08 +00:00
<link href="../docs-assets/Base.css" rel="stylesheet" rev="stylesheet" type="text/css">
<script>
MathJax = {
2020-04-21 23:52:25 +00:00
tex: {
inlineMath: '$', '$'], ['\\(', '\\)'
},
svg: {
fontCache: 'global'
}
};
</script>
<script type="text/javascript" id="MathJax-script" async
2020-04-21 23:52:25 +00:00
src="https://cdn.jsdelivr.net/npm/mathjax@3/es5/tex-svg.js">
</script>
2020-04-21 16:55:17 +00:00
<link href="../docs-assets/Colours.css" rel="stylesheet" rev="stylesheet" type="text/css">
<link href="../docs-assets/ConsoleText-Colours.css" rel="stylesheet" rev="stylesheet" type="text/css">
2020-04-12 16:24:23 +00:00
</head>
<body>
<nav role="navigation">
2020-04-13 16:06:45 +00:00
<h1><a href="../index.html">
2020-04-20 22:26:08 +00:00
<img src="../docs-assets/Octagram.png" width=72 height=72">
2020-04-13 16:06:45 +00:00
</a></h1>
<ul><li><a href="../inweb/index.html">inweb</a></li>
</ul><h2>Foundation Module</h2><ul>
<li><a href="../foundation-module/index.html">foundation</a></li>
2020-04-12 16:24:23 +00:00
<li><a href="../foundation-test/index.html">foundation-test</a></li>
2020-04-13 16:06:45 +00:00
</ul><h2>Example Webs</h2><ul>
<li><a href="index.html"><span class="selectedlink">goldbach</span></a></li>
2020-04-12 16:24:23 +00:00
<li><a href="../twinprimes/twinprimes.html">twinprimes</a></li>
2020-04-15 22:45:08 +00:00
<li><a href="../eastertide/index.html">eastertide</a></li>
2020-04-14 17:36:42 +00:00
</ul><h2>Repository</h2><ul>
2020-04-20 22:34:44 +00:00
<li><a href="https://github.com/ganelson/inweb"><img src="../docs-assets/github.png" height=18> github</a></li>
2020-04-14 17:36:42 +00:00
</ul><h2>Related Projects</h2><ul>
<li><a href="../../../inform/docs/index.html">inform</a></li>
<li><a href="../../../intest/docs/index.html">intest</a></li>
2020-04-12 16:24:23 +00:00
2020-04-13 16:06:45 +00:00
</ul>
2020-04-12 16:24:23 +00:00
</nav>
<main role="main">
2020-04-21 16:55:17 +00:00
<!--Weave of 'Summing Primes' generated by Inweb-->
<ul class="crumbs"><li><a href="../index.html">Home</a></li><li><a href="index.html">The Goldbach Conjecture</a></li><li><b>Summing Primes</b></li></ul><p class="purpose">Here we verify the conjecture for small numbers.</p>
2020-04-12 16:24:23 +00:00
2020-04-20 22:26:08 +00:00
<p class="inwebparagraph"><a id="SP1"></a><b>&#167;1. </b>So, this is a program to see if even numbers from 4 to 100 can all be written
2020-04-12 16:24:23 +00:00
as a sum of two primes. Christian Goldbach asked Euler in 1742 if every even
number greater than 2 can be written this way. This remains open, though &mdash;
2020-04-12 16:24:23 +00:00
</p>
<ul class="items"><li>(a) every even number is a sum of at most six primes (Ramaré, 1995), and
</li><li>(b) every odd number is a sum of at most five (Tao, 2012).
</li></ul>
2020-04-22 11:31:01 +00:00
<center><img src="Letter.jpg" height="720"></center>
2020-04-20 22:26:08 +00:00
<p class="inwebparagraph">Computer verification has been made up to around \(10^{18}\), but by rather better
2020-04-22 23:31:36 +00:00
methods. We will proceed only to:
2020-04-21 23:52:25 +00:00
</p>
2020-04-12 16:24:23 +00:00
<pre class="definitions">
2020-04-20 22:26:08 +00:00
<span class="definition-keyword">define</span> <span class="constant-syntax">RANGE</span><span class="plain-syntax"> </span><span class="constant-syntax">100</span>
2020-04-12 16:24:23 +00:00
</pre>
2020-04-21 16:55:17 +00:00
<pre class="displayed-code all-displayed-code">
<span class="plain-syntax">#</span><span class="identifier-syntax">include</span><span class="plain-syntax"> &lt;</span><span class="identifier-syntax">stdio</span><span class="plain-syntax">.</span><span class="identifier-syntax">h</span><span class="plain-syntax">&gt;</span>
2020-04-12 16:24:23 +00:00
2020-04-21 16:55:17 +00:00
<span class="reserved-syntax">int</span><span class="plain-syntax"> </span><span class="function-syntax">main</span><span class="plain-syntax">(</span><span class="reserved-syntax">int</span><span class="plain-syntax"> </span><span class="identifier-syntax">argc</span><span class="plain-syntax">, </span><span class="reserved-syntax">char</span><span class="plain-syntax"> *</span><span class="identifier-syntax">argv</span><span class="plain-syntax">[]) {</span>
<span class="plain-syntax"> </span><span class="reserved-syntax">for</span><span class="plain-syntax"> (</span><span class="reserved-syntax">int</span><span class="plain-syntax"> </span><span class="identifier-syntax">i</span><span class="plain-syntax">=4; </span><span class="identifier-syntax">i</span><span class="plain-syntax">&lt;</span><span class="constant-syntax">RANGE</span><span class="plain-syntax">; </span><span class="identifier-syntax">i</span><span class="plain-syntax">=</span><span class="identifier-syntax">i</span><span class="plain-syntax">+2) </span><span class="comment"> stepping in twos to stay even</span>
2020-04-22 23:31:36 +00:00
<span class="plain-syntax"> </span>&lt;<span class="named-paragraph">Solve Goldbach's conjecture for i</span> <span class="named-paragraph-number">1.1</span>&gt;<span class="character-syntax">;</span>
2020-04-21 16:55:17 +00:00
<span class="character-syntax">}</span>
2020-04-22 23:31:36 +00:00
</pre><p class="inwebparagraph"><a id="SP1_1"></a><b>&#167;1.1. </b>This ought to print:
2020-04-12 16:24:23 +00:00
</p>
2020-04-21 16:55:17 +00:00
<pre class="ConsoleText-displayed-code all-displayed-code">
2020-04-22 23:31:36 +00:00
<span class="ConsoleText-plain-syntax"> </span><span class="ConsoleText-element-syntax">$</span><span class="ConsoleText-plain-syntax"> </span><span class="ConsoleText-function-syntax">goldbach/Tangled/goldbach</span>
2020-04-21 16:55:17 +00:00
<span class="ConsoleText-plain-syntax"> 4 = 2+2</span>
2020-04-22 23:31:36 +00:00
<span class="ConsoleText-plain-syntax"> 6 = 3+3</span>
2020-04-21 16:55:17 +00:00
<span class="ConsoleText-plain-syntax"> 8 = 3+5</span>
<span class="ConsoleText-plain-syntax"> 10 = 3+7 = 5+5</span>
<span class="ConsoleText-plain-syntax"> 12 = 5+7</span>
<span class="ConsoleText-plain-syntax"> 14 = 3+11 = 7+7</span>
<span class="ConsoleText-plain-syntax"> ...</span>
2020-04-12 16:24:23 +00:00
</pre>
<p class="inwebparagraph">We'll print each different pair of primes adding up to i. We
only check in the range \(2 \leq j \leq i/2\) to avoid counting pairs
twice over (thus \(8 = 3+5 = 5+3\), but that's hardly two different ways).
</p>
<p class="macrodefinition"><code class="display">
2020-04-22 23:31:36 +00:00
&lt;<span class="named-paragraph-defn">Solve Goldbach's conjecture for i</span> <span class="named-paragraph-number">1.1</span>&gt; =
2020-04-12 16:24:23 +00:00
</code></p>
2020-04-21 16:55:17 +00:00
<pre class="displayed-code all-displayed-code">
<span class="plain-syntax"> </span><span class="identifier-syntax">printf</span><span class="plain-syntax">(</span><span class="string-syntax">"%d"</span><span class="plain-syntax">, </span><span class="identifier-syntax">i</span><span class="plain-syntax">);</span>
<span class="plain-syntax"> </span><span class="reserved-syntax">for</span><span class="plain-syntax"> (</span><span class="reserved-syntax">int</span><span class="plain-syntax"> </span><span class="identifier-syntax">j</span><span class="plain-syntax">=2; </span><span class="identifier-syntax">j</span><span class="plain-syntax">&lt;=</span><span class="identifier-syntax">i</span><span class="plain-syntax">/2; </span><span class="identifier-syntax">j</span><span class="plain-syntax">++)</span>
<span class="plain-syntax"> </span><span class="reserved-syntax">if</span><span class="plain-syntax"> ((</span><a href="S-tsoe.html#SP2" class="function-link"><span class="function-syntax">isprime</span></a><span class="plain-syntax">(</span><span class="identifier-syntax">j</span><span class="plain-syntax">)) &amp;&amp; (</span><a href="S-tsoe.html#SP2" class="function-link"><span class="function-syntax">isprime</span></a><span class="plain-syntax">(</span><span class="identifier-syntax">i</span><span class="plain-syntax">-</span><span class="identifier-syntax">j</span><span class="plain-syntax">)))</span>
<span class="plain-syntax"> </span><span class="identifier-syntax">printf</span><span class="plain-syntax">(</span><span class="string-syntax">" = %d+%d"</span><span class="plain-syntax">, </span><span class="identifier-syntax">j</span><span class="plain-syntax">, </span><span class="identifier-syntax">i</span><span class="plain-syntax">-</span><span class="identifier-syntax">j</span><span class="plain-syntax">);</span>
<span class="plain-syntax"> </span><span class="identifier-syntax">printf</span><span class="plain-syntax">(</span><span class="string-syntax">"\n"</span><span class="plain-syntax">);</span>
2020-04-22 23:31:36 +00:00
</pre><ul class="endnotetexts"><li>This code is used in <a href="S-sp.html#SP1">&#167;1</a>.</li></ul><hr class="tocbar">
2020-04-12 16:24:23 +00:00
<ul class="toc"><li><i>(This section begins Sections.)</i></li><li><a href="S-tsoe.html">Continue with 'The Sieve of Eratosthenes'</a></li></ul><hr class="tocbar">
<!--End of weave-->
</main>
</body>
</html>