<sectionid="description"> Considera la fracción, n / d, donde n y d son enteros positivos. Si n <d1=""2=""3=""4=""5=""6=""7=""8=""and=""hcf(n,d)="1,"it=""is=""called=""a=""reduced=""proper=""fraction.=""if=""we=""list=""the=""set=""of=""fractions=""for=""d=""≤=""in=""ascending=""order=""size,=""get:=""8,=""7,=""6,=""5,=""4,=""3,=""2,=""can=""be=""seen=""that=""there=""are=""between=""2.=""how=""many=""lie=""sorted=""12,000?=""<=""section=""><h2> Instrucciones </h2><sectionid="instructions"></section><h2> Pruebas </h2><sectionid="tests"><pre><codeclass="language-yml">tests: - text: <code>euler73()</code> should return 7295372. testString: 'assert.strictEqual(euler73(), 7295372, "<code>euler73()</code> should return 7295372.");'</code></pre></section><h2> Semilla de desafío </h2><sectionid="challengeSeed"><divid="js-seed"><pre><codeclass="language-js">function euler73() { // Good luck! return true; } euler73();</code></pre></div></section><h2> Solución </h2><sectionid="solution"><pre><codeclass="language-js">// solution required</code></pre></section></d></section>