Project Euler: http://projecteuler.net/
This commit is contained in:
100
ProjectEuler/pe/p101.html
Normal file
100
ProjectEuler/pe/p101.html
Normal file
@@ -0,0 +1,100 @@
|
||||
<!DOCTYPE html>
|
||||
<html lang="en">
|
||||
<head>
|
||||
<meta charset="utf-8" />
|
||||
<meta name="author" content="Colin Hughes" />
|
||||
<meta name="description" content="A website dedicated to the fascinating world of mathematics and programming" />
|
||||
<meta name="keywords" content="programming,mathematics,problems,puzzles" />
|
||||
|
||||
<title>Problem 101 - Project Euler</title>
|
||||
<link rel="shortcut icon" href="http://projecteuler.net/favicon.ico" />
|
||||
<link rel="stylesheet" type="text/css" href="style_main.css" />
|
||||
<link rel="stylesheet" type="text/css" href="style_light.css" />
|
||||
<script type="text/x-mathjax-config">
|
||||
MathJax.Hub.Config({
|
||||
jax: ["input/TeX", "output/HTML-CSS"],
|
||||
tex2jax: {
|
||||
inlineMath: [ ["$","$"], ["\\(","\\)"] ],
|
||||
displayMath: [ ["$$","$$"], ["\\[","\\]"] ],
|
||||
processEscapes: true
|
||||
},
|
||||
"HTML-CSS": { availableFonts: ["TeX"] }
|
||||
});
|
||||
</script>
|
||||
|
||||
<script type="text/javascript" src="http://cdn.mathjax.org/mathjax/latest/MathJax.js?config=TeX-AMS_HTML">
|
||||
</script>
|
||||
</head>
|
||||
|
||||
<body>
|
||||
<div id="container">
|
||||
|
||||
<div id="nav" class="noprint">
|
||||
<ul>
|
||||
<li><a href="about" title="About" accesskey="h">About</a></li>
|
||||
<li><a href="register" title="Register" accesskey="1">Register</a></li>
|
||||
<li id="current"><a href="problems" title="Problems" accesskey="2">Problems</a></li>
|
||||
<li><a href="login" title="Login" accesskey="3">Login</a></li>
|
||||
</ul>
|
||||
</div>
|
||||
<div id="info_panel"><a href="rss2_euler.xml"><img src="images/icon_rss.png" alt="RSS Feed" title="RSS Feed" /></a><a href="secure=59773"><img src="images/icon_lock.png" alt="Use secure connection" title="Use secure connection" /></a></div>
|
||||
|
||||
<div id="logo" class="noprint">
|
||||
<img src="images/pe_banner_light.png" alt="Project Euler .net" />
|
||||
</div>
|
||||
|
||||
<div id="content">
|
||||
<div style="text-align:center;" class="print"><img src="images/pe_banner.png" alt="projecteuler.net" style="border:none;" /></div>
|
||||
<h2>Optimum polynomial</h2><div class="info" style="cursor:help;width:200px;margin-bottom:10px;"><h3>Problem 101</h3><span style="width:300px;color:#666;">Published on Friday, 29th July 2005, 06:00 pm; Solved by 4918</span></div>
|
||||
<div class="problem_content" role="problem">
|
||||
<p>If we are presented with the first <var>k</var> terms of a sequence it is impossible to say with certainty the value of the next term, as there are infinitely many polynomial functions that can model the sequence.</p>
|
||||
<p>As an example, let us consider the sequence of cube numbers. This is defined by the generating function, <br /><var>u</var><sub><var>n</var></sub> = <var>n</var><sup>3</sup>: 1, 8, 27, 64, 125, 216, ...</p>
|
||||
<p>Suppose we were only given the first two terms of this sequence. Working on the principle that "simple is best" we should assume a linear relationship and predict the next term to be 15 (common difference 7). Even if we were presented with the first three terms, by the same principle of simplicity, a quadratic relationship should be assumed.</p>
|
||||
<p>We shall define OP(<var>k</var>, <var>n</var>) to be the <var>n</var><sup>th</sup> term of the optimum polynomial generating function for the first <var>k</var> terms of a sequence. It should be clear that OP(<var>k</var>, <var>n</var>) will accurately generate the terms of the sequence for <var>n</var> <img src='images/symbol_le.gif' width='10' height='12' alt='≤' border='0' style='vertical-align:middle;' /> <var>k</var>, and potentially the <i>first incorrect term</i> (FIT) will be OP(<var>k</var>, <var>k</var>+1); in which case we shall call it a <i>bad OP</i> (BOP).</p>
|
||||
<p>As a basis, if we were only given the first term of sequence, it would be most sensible to assume constancy; that is, for <var>n</var> <img src='images/symbol_ge.gif' width='10' height='12' alt='≥' border='0' style='vertical-align:middle;' /> 2, OP(1, <var>n</var>) = <var>u</var><sub>1</sub>.</p>
|
||||
<p>Hence we obtain the following OPs for the cubic sequence:</p>
|
||||
<div style='margin-left:50px;'>
|
||||
<table>
|
||||
<tr>
|
||||
<td>OP(1, <var>n</var>) = 1</td>
|
||||
<td>1, <span style='color:red;'><b>1</b></span>, 1, 1, ...</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>OP(2, <var>n</var>) = 7<var>n</var><img src='images/symbol_minus.gif' width='9' height='3' alt='−' border='0' style='vertical-align:middle;' />6</td>
|
||||
<td>1, 8, <span style='color:red;'><b>15</b></span>, ...</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>OP(3, <var>n</var>) = 6<var>n</var><sup>2</sup><img src='images/symbol_minus.gif' width='9' height='3' alt='−' border='0' style='vertical-align:middle;' />11<var>n</var>+6 </td>
|
||||
<td>1, 8, 27, <span style='color:red;'><b>58</b></span>, ...</td>
|
||||
</tr>
|
||||
<tr>
|
||||
<td>OP(4, <var>n</var>) = <var>n</var><sup>3</sup></td>
|
||||
<td>1, 8, 27, 64, 125, ...</td>
|
||||
</tr>
|
||||
</table>
|
||||
</div>
|
||||
<p>Clearly no BOPs exist for <var>k</var> <img src='images/symbol_ge.gif' width='10' height='12' alt='≥' border='0' style='vertical-align:middle;' /> 4.</p>
|
||||
<p>By considering the sum of FITs generated by the BOPs (indicated in <span style='color:red;'><b>red</b></span> above), we obtain 1 + 15 + 58 = 74.</p>
|
||||
<p>Consider the following tenth degree polynomial generating function:</p>
|
||||
<p style='text-align:center;'><var>u</var><sub><var>n</var></sub> = 1 <img src='images/symbol_minus.gif' width='9' height='3' alt='−' border='0' style='vertical-align:middle;' /> <var>n</var> + <var>n</var><sup>2</sup> <img src='images/symbol_minus.gif' width='9' height='3' alt='−' border='0' style='vertical-align:middle;' /> <var>n</var><sup>3</sup> + <var>n</var><sup>4</sup> <img src='images/symbol_minus.gif' width='9' height='3' alt='−' border='0' style='vertical-align:middle;' /> <var>n</var><sup>5</sup> + <var>n</var><sup>6</sup> <img src='images/symbol_minus.gif' width='9' height='3' alt='−' border='0' style='vertical-align:middle;' /> <var>n</var><sup>7</sup> + <var>n</var><sup>8</sup> <img src='images/symbol_minus.gif' width='9' height='3' alt='−' border='0' style='vertical-align:middle;' /> <var>n</var><sup>9</sup> + <var>n</var><sup>10</sup></p>
|
||||
<p>Find the sum of FITs for the BOPs.</p>
|
||||
|
||||
</div><br />
|
||||
<br /></div>
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
<div id="footer" class="noprint">
|
||||
<a href="copyright">Project Euler Copyright Information</a>
|
||||
<!--/Creative Commons License--><!-- <rdf:RDF xmlns="http://web.resource.org/cc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#">
|
||||
<Work rdf:about="">
|
||||
<license rdf:resource="http://creativecommons.org/licenses/by-nc-sa/2.0/uk/" />
|
||||
<dc:type rdf:resource="http://purl.org/dc/dcmitype/Text" />
|
||||
</Work>
|
||||
<License rdf:about="http://creativecommons.org/licenses/by-nc-sa/2.0/uk/"><permits rdf:resource="http://web.resource.org/cc/Reproduction"/><permits rdf:resource="http://web.resource.org/cc/Distribution"/><requires rdf:resource="http://web.resource.org/cc/Notice"/><requires rdf:resource="http://web.resource.org/cc/Attribution"/><prohibits rdf:resource="http://web.resource.org/cc/CommercialUse"/><permits rdf:resource="http://web.resource.org/cc/DerivativeWorks"/><requires rdf:resource="http://web.resource.org/cc/ShareAlike"/></License></rdf:RDF> -->
|
||||
</div>
|
||||
</div>
|
||||
<div style="height:1px;"> </div></body>
|
||||
</html>
|
||||
Reference in New Issue
Block a user