npm - eyeling - Versions diffs - 1.16.3 → 1.16.4 - Mend

eyeling 1.16.3 → 1.16.4

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (45) hide show

package/README.md +0 -1
package/package.json +2 -3
package/arctifacts/README.md +0 -59
package/arctifacts/ackermann.html +0 -678
package/arctifacts/auroracare.html +0 -1297
package/arctifacts/bike-trip.html +0 -752
package/arctifacts/binomial-theorem.html +0 -631
package/arctifacts/bmi.html +0 -511
package/arctifacts/building-performance.html +0 -750
package/arctifacts/clinical-care.html +0 -726
package/arctifacts/collatz.html +0 -403
package/arctifacts/complex.html +0 -321
package/arctifacts/control-system.html +0 -482
package/arctifacts/delfour.html +0 -849
package/arctifacts/earthquake-epicenter.html +0 -982
package/arctifacts/eco-route.html +0 -662
package/arctifacts/euclid-infinitude.html +0 -564
package/arctifacts/euler-identity.html +0 -667
package/arctifacts/exoplanet-transit.html +0 -1000
package/arctifacts/faltings-theorem.html +0 -1046
package/arctifacts/fibonacci.html +0 -299
package/arctifacts/fundamental-theorem-arithmetic.html +0 -398
package/arctifacts/godel-numbering.html +0 -743
package/arctifacts/gps-bike.html +0 -759
package/arctifacts/gps-clinical-bench.html +0 -792
package/arctifacts/graph-french.html +0 -449
package/arctifacts/grass-molecular.html +0 -592
package/arctifacts/group-theory.html +0 -740
package/arctifacts/health-info.html +0 -833
package/arctifacts/kaprekar-constant.html +0 -576
package/arctifacts/lee.html +0 -805
package/arctifacts/linked-lists.html +0 -502
package/arctifacts/lldm.html +0 -612
package/arctifacts/matrix-multiplication.html +0 -502
package/arctifacts/matrix.html +0 -651
package/arctifacts/newton-raphson.html +0 -944
package/arctifacts/peano-factorial.html +0 -456
package/arctifacts/pi.html +0 -363
package/arctifacts/polynomial.html +0 -646
package/arctifacts/prime.html +0 -366
package/arctifacts/pythagorean-theorem.html +0 -468
package/arctifacts/rest-path.html +0 -469
package/arctifacts/roots-of-unity.html +0 -363
package/arctifacts/turing.html +0 -409
package/arctifacts/wind-turbines.html +0 -726

package/arctifacts/fibonacci.html DELETED Viewed

@@ -1,299 +0,0 @@
-<!doctype html>
-<html lang="en">
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1" />
-    <title>Fibonacci via Fast Doubling</title>
-    <style>
-      :root {
-        --fg: #101014;
-        --bg: #ffffff;
-        --muted: #666;
-        --accent: #2563eb;
-        --chip: #eef2ff;
-      }
-      @media (prefers-color-scheme: dark) {
-        :root {
-          --fg: #eaeaf0;
-          --bg: #0b0b10;
-          --muted: #a0a0b0;
-          --accent: #60a5fa;
-          --chip: #0e1a32;
-        }
-      }
-      html,
-      body {
-        margin: 0;
-        padding: 0;
-        background: var(--bg);
-        color: var(--fg);
-        font:
-          15px/1.6 ui-sans-serif,
-          system-ui,
-          -apple-system,
-          Segoe UI,
-          Roboto,
-          Helvetica,
-          Arial;
-      }
-      main {
-        max-width: 1100px;
-        margin: 0 auto;
-        padding: 28px 16px 80px;
-      }
-      h1 {
-        font-size: clamp(1.6rem, 2.6vw + 1rem, 2.2rem);
-        margin: 0 0 6px;
-      }
-      header p {
-        margin: 0;
-        color: var(--muted);
-      }
-      section {
-        margin: 18px 0 22px;
-        padding: 14px 14px 16px;
-        border: 1px solid color-mix(in srgb, var(--accent) 18%, transparent);
-        border-radius: 14px;
-        background: color-mix(in srgb, var(--accent) 4%, transparent);
-      }
-      section h2 {
-        margin: 0 0 8px;
-        font-size: 1.15rem;
-      }
-      .grid {
-        display: grid;
-        grid-template-columns: repeat(auto-fit, minmax(280px, 1fr));
-        gap: 10px;
-      }
-      .chip {
-        display: inline-block;
-        padding: 2px 8px;
-        border-radius: 999px;
-        background: var(--chip);
-        font-weight: 600;
-      }
-      .muted {
-        color: var(--muted);
-      }
-      .mono {
-        font-family: ui-monospace, SFMono-Regular, Menlo, Consolas, 'Liberation Mono', monospace;
-      }
-      .tbl {
-        width: 100%;
-        border-collapse: collapse;
-      }
-      .tbl th,
-      .tbl td {
-        padding: 6px 8px;
-        border-bottom: 1px dashed color-mix(in srgb, var(--fg) 18%, transparent);
-        vertical-align: top;
-      }
-      .tbl th {
-        text-align: left;
-      }
-      .ok {
-        color: #16a34a;
-      }
-      .bad {
-        color: #dc2626;
-      }
-      .small {
-        font-size: 0.92em;
-      }
-      code {
-        background: color-mix(in srgb, var(--accent) 10%, transparent);
-        padding: 0.1rem 0.35rem;
-        border-radius: 0.35rem;
-      }
-      details {
-        border-radius: 10px;
-        padding: 10px 12px;
-        background: color-mix(in srgb, var(--accent) 6%, transparent);
-      }
-      summary {
-        cursor: pointer;
-        font-weight: 700;
-      }
-    </style>
-  </head>
-  <body>
-    <main>
-      <header>
-        <h1>Fibonacci via Fast Doubling</h1>
-      </header>
-      <section>
-        <h2>What this is?</h2>
-        <p>
-          A self‑contained explainer that computes selected Fibonacci numbers exactly using the
-          <em>fast‑doubling</em> identities. It shows the <strong>Answer</strong> (exact values and digit counts), the
-          <strong>Reason why</strong> (the identities used), and a <strong>Check</strong> harness that verifies base
-          cases, the recurrence, an addition identity, and cross‑checks against a simple linear iterator.
-        </p>
-        <p class="small muted">Time per F<sub>n</sub> is O(log n); everything is integer‑exact with BigInt.</p>
-      </section>
-      <section id="answer">
-        <h2>Answer</h2>
-        <div id="answer-body"></div>
-      </section>
-      <section id="reason">
-        <h2>Reason why</h2>
-        <div>
-          <p>
-            Define Fibonacci by F<sub>0</sub>=0, F<sub>1</sub>=1, and F<sub>n+2</sub>=F<sub>n+1</sub>+F<sub>n</sub>.
-          </p>
-          <p>A standard addition identity (provable by induction) is:</p>
-          <p class="mono">
-            (A) &nbsp; F<sub>m+n</sub> = F<sub>m</sub>·F<sub>n+1</sub> + F<sub>m−1</sub>·F<sub>n</sub> &nbsp; (for m,n ≥
-            1)
-          </p>
-          <p>Specializing (A) yields fast‑doubling from (F<sub>k</sub>, F<sub>k+1</sub>):</p>
-          <ul class="mono">
-            <li>F<sub>2k</sub> = F<sub>k</sub> ( 2F<sub>k+1</sub> − F<sub>k</sub> )</li>
-            <li>F<sub>2k+1</sub> = F<sub>k+1</sub><sup>2</sup> + F<sub>k</sub><sup>2</sup></li>
-          </ul>
-          <p>
-            One recursive call on k=⌊n/2⌋ computes both F<sub>2k</sub> and F<sub>2k+1</sub>, then picks (F<sub>n</sub>,
-            F<sub>n+1</sub>) by parity.
-          </p>
-        </div>
-      </section>
-      <section id="check">
-        <h2>Check (harness)</h2>
-        <div id="check-body"></div>
-      </section>
-    </main>
-    <script>
-      (function () {
-        'use strict';
-        // ------------------ BigInt fast-doubling core ------------------
-        const Z0 = 0n,
-          Z1 = 1n,
-          Z2 = 2n;
-        function fibFastDoubling(n) {
-          // returns [F_n, F_{n+1}] as BigInts
-          if (n === 0) return [Z0, Z1];
-          const [fk, fk1] = fibFastDoubling(n >> 1);
-          const c = fk * (Z2 * fk1 - fk); // F_{2k}
-          const d = fk * fk + fk1 * fk1; // F_{2k+1}
-          if (n & 1) {
-            // odd
-            return [d, c + d];
-          } else {
-            // even
-            return [c, d];
-          }
-        }
-        function fibLinear(n) {
-          let a = Z0,
-            b = Z1;
-          for (let i = 0; i < n; i++) {
-            const t = a + b;
-            a = b;
-            b = t;
-          }
-          return a;
-        }
-        function digitsOf(x) {
-          // x is BigInt, nonnegative
-          return x === Z0 ? 1 : x.toString().length;
-        }
-        // ------------------ Answer ------------------
-        const indices = [0, 1, 6, 91, 283, 3674];
-        const answerBody = document.getElementById('answer-body');
-        (function renderAnswer() {
-          let html =
-            '<table class="tbl mono small"><thead><tr><th>n</th><th>F_n (exact)</th><th>digits</th></tr></thead><tbody>';
-          for (const n of indices) {
-            const [fn] = fibFastDoubling(n);
-            html += `<tr><td>${n}</td><td style="word-break:break-all">${fn.toString()}</td><td>${digitsOf(fn)}</td></tr>`;
-          }
-          html += '</tbody></table>';
-          answerBody.innerHTML = html;
-        })();
-        // ------------------ Harness (checks) ------------------
-        function runChecks() {
-          let okAll = true;
-          const lines = [];
-          // 1) Base pair
-          const [f0, f1] = fibFastDoubling(0);
-          const okBase = f0 === Z0 && f1 === Z1;
-          lines.push(`Base pair correct? ${okBase}`);
-          okAll = okAll && okBase;
-          // 2) Recurrence on n in [0,1000)
-          let okRecur = true;
-          for (let n = 0; n < 1000; n++) {
-            const [fn, fn1] = fibFastDoubling(n);
-            const [fn2] = fibFastDoubling(n + 2);
-            if (fn + fn1 !== fn2) {
-              okRecur = false;
-              lines.push(` Recurrence failed at n=${n}`);
-              break;
-            }
-          }
-          lines.push(`Recurrence holds on n ∈ [0,1000)? ${okRecur}`);
-          okAll = okAll && okRecur;
-          // 3) Addition identity grid
-          let okAdd = true;
-          for (let m = 1; m < 60 && okAdd; m++) {
-            const [fm, fm1] = fibFastDoubling(m);
-            const [fm_1] = fibFastDoubling(m - 1);
-            for (let n = 0; n < 60; n++) {
-              const [lhs] = fibFastDoubling(m + n);
-              const [fn, fn1] = fibFastDoubling(n);
-              const rhs = fm * fn1 + fm_1 * fn;
-              if (lhs !== rhs) {
-                okAdd = false;
-                lines.push(` (A) failed at m=${m}, n=${n}`);
-                break;
-              }
-            }
-          }
-          lines.push(`Addition identity (A) holds on m∈[1,60), n∈[0,60)? ${okAdd}`);
-          okAll = okAll && okAdd;
-          // 4) Cross-check vs linear on n in [0,2000)
-          let okCross = true;
-          for (let n = 0; n < 2000; n++) {
-            if (fibFastDoubling(n)[0] !== fibLinear(n)) {
-              okCross = false;
-              lines.push(` Cross-check failed at n=${n}`);
-              break;
-            }
-          }
-          lines.push(`Cross-check vs linear on n ∈ [0,2000)? ${okCross}`);
-          okAll = okAll && okCross;
-          lines.push('');
-          lines.push(`All checks passed? ${okAll}`);
-          return lines;
-        }
-        (function renderChecks() {
-          const out = runChecks();
-          const wrap = document.getElementById('check-body');
-          const pre = document.createElement('pre');
-          pre.className = 'mono';
-          pre.style.whiteSpace = 'pre-wrap';
-          pre.textContent = out.join('\n'); // use real newlines
-          wrap.replaceChildren(pre);
-        })();
-      })();
-    </script>
-  </body>
-</html>

package/arctifacts/fundamental-theorem-arithmetic.html DELETED Viewed

@@ -1,398 +0,0 @@
-<!doctype html>
-<html lang="en">
-  <head>
-    <meta charset="utf-8" />
-    <meta name="viewport" content="width=device-width, initial-scale=1" />
-    <title>Fundamental Theorem of Arithmetic</title>
-    <style>
-      :root {
-        --bg: #f7f9fc;
-        --card: #ffffff;
-        --text: #0f172a;
-        --muted: #475569;
-        --border: #e2e8f0;
-      }
-      html,
-      body {
-        background: var(--bg);
-        color: var(--text);
-        font-family:
-          ui-sans-serif,
-          system-ui,
-          -apple-system,
-          Segoe UI,
-          Roboto,
-          Helvetica,
-          Arial;
-      }
-      .container {
-        max-width: 960px;
-        margin: 24px auto;
-        padding: 0 16px;
-      }
-      .card {
-        background: var(--card);
-        border: 1px solid var(--border);
-        border-radius: 16px;
-        padding: 16px;
-        box-shadow: 0 6px 20px rgba(2, 6, 23, 0.05);
-      }
-      .stack {
-        display: flex;
-        flex-direction: column;
-        gap: 16px;
-      }
-      .row {
-        display: flex;
-        align-items: center;
-        gap: 12px;
-      }
-      .mono {
-        font-family: ui-monospace, SFMono-Regular, Menlo, Monaco, Consolas, 'Courier New', monospace;
-        word-break: break-word;
-        overflow-wrap: anywhere;
-      }
-      .badge {
-        padding: 2px 8px;
-        border: 1px solid #cbd5e1;
-        border-radius: 999px;
-        font-weight: 700;
-        font-size: 12px;
-        background: #f1f5f9;
-        color: #0f172a;
-      }
-      .ok {
-        background: #dcfce7;
-        border: 1px solid #86efac;
-      }
-      .fail {
-        background: #fee2e2;
-        border: 1px solid #fecaca;
-      }
-      .kpi {
-        display: flex;
-        gap: 16px;
-        flex-wrap: wrap;
-      }
-      .kpi .card {
-        padding: 12px 14px;
-      }
-      input.short {
-        width: 180px;
-        padding: 6px 8px;
-        border: 1px solid var(--border);
-        border-radius: 10px;
-        background: #fbfdff;
-      }
-    </style>
-  </head>
-  <body>
-    <div class="container stack">
-      <header class="card stack">
-        <h1 style="margin: 0">Fundamental Theorem of Arithmetic</h1>
-        <div class="badge">
-          Every integer <span class="mono">n≥2</span> factors as a product of primes, uniquely up to order.
-        </div>
-        <div class="row">
-          <label class="mono" for="nInput">n (integer ≥ 2)</label
-          ><input class="short" id="nInput" type="number" min="2" step="1" value="67564329" /><button id="factorBtn">
-            Factor</button
-          ><button id="clearBtn">Clear</button>
-        </div>
-        <div class="mono" id="status" style="color: #475569"></div>
-      </header>
-      <!-- 1) ANSWER -->
-      <section class="card stack" id="answer">
-        <h2 style="margin: 0">Answer</h2>
-        <div class="kpi">
-          <div class="card">
-            <div class="k">n</div>
-            <div id="a_n" class="mono">—</div>
-          </div>
-          <div class="card">
-            <div class="k">Prime factors</div>
-            <div id="a_pf" class="mono">—</div>
-          </div>
-          <div class="card">
-            <div class="k">Prime‑power form</div>
-            <div id="a_pp" class="mono">—</div>
-          </div>
-          <div class="card">
-            <div class="k">Check product</div>
-            <div id="a_prod" class="mono">—</div>
-          </div>
-          <div class="card">
-            <div class="k"># distinct primes</div>
-            <div id="a_cnt" class="mono">—</div>
-          </div>
-        </div>
-      </section>
-      <!-- 2) REASON WHY -->
-      <section class="card stack" id="reason">
-        <h2 style="margin: 0">Reason Why</h2>
-        <div class="mono">
-          (Existence) If <span class="mono">n≥2</span> is composite, write <span class="mono">n=ab</span> with
-          <span class="mono">a,b≥2</span>; repeat until primes — the process terminates. (Uniqueness) If
-          <span class="mono">n=p_1⋯p_r=q_1⋯q_s</span> with primes, then by Euclid’s lemma a prime dividing a product
-          divides one factor; match equal primes and cancel, showing the multisets are equal. Hence factorization is
-          unique up to order.
-        </div>
-      </section>
-      <!-- 3) CHECK (HARNESS) -->
-      <section class="card stack" id="check">
-        <h2 style="margin: 0">Check (harness)</h2>
-        <div id="checks" class="stack"></div>
-        <div class="row"><button id="runAll">Run all</button><button id="clearChecks">Clear results</button></div>
-      </section>
-    </div>
-    <script>
-      (function () {
-        function $(id) {
-          return document.getElementById(id);
-        }
-        function setStatus(msg) {
-          var s = $('status');
-          if (s) s.textContent = msg;
-        }
-        function isInteger(x) {
-          return typeof x === 'number' && isFinite(x) && Math.floor(x) === x;
-        }
-        function isPrime(n) {
-          if (n < 2) return false;
-          if (n % 2 === 0) return n === 2;
-          if (n % 3 === 0) return n === 3;
-          var i = 5,
-            step = 2;
-          while (i * i <= n) {
-            if (n % i === 0) return false;
-            i += step;
-            step = 6 - step;
-          }
-          return true;
-        }
-        function factor(n) {
-          var m = n;
-          var fac = [];
-          while (m % 2 === 0) {
-            fac.push(2);
-            m /= 2;
-          }
-          while (m % 3 === 0) {
-            fac.push(3);
-            m /= 3;
-          }
-          var f = 5,
-            step = 2; // 6k±1 wheel: 5,7,11,13,17,19,...
-          while (f * f <= m) {
-            while (m % f === 0) {
-              fac.push(f);
-              m /= f;
-            }
-            f += step;
-            step = 6 - step;
-          }
-          if (m > 1) fac.push(m);
-          return fac;
-        }
-        function product(list) {
-          var r = 1,
-            i;
-          for (i = 0; i < list.length; i++) r *= list[i];
-          return r;
-        }
-        function groupPowers(list) {
-          if (!list.length) return { pairs: [], text: '1' };
-          list = list.slice().sort(function (a, b) {
-            return a - b;
-          });
-          var pairs = [],
-            i = 0;
-          while (i < list.length) {
-            var p = list[i],
-              e = 1;
-            i++;
-            while (i < list.length && list[i] === p) {
-              e++;
-              i++;
-            }
-            pairs.push([p, e]);
-          }
-          var text = pairs
-            .map(function (pe) {
-              return pe[1] === 1 ? String(pe[0]) : pe[0] + '^' + pe[1];
-            })
-            .join(' · ');
-          return { pairs: pairs, text: text, list: list };
-        }
-        function showAnswer(n, fac) {
-          var grp = groupPowers(fac);
-          $('a_n').textContent = String(n);
-          $('a_pf').textContent = grp.list.length ? grp.list.join(' · ') : '—';
-          $('a_pp').textContent = grp.text;
-          $('a_cnt').textContent = String(grp.pairs.length);
-          $('a_prod').textContent = grp.list.length ? String(product(grp.list)) : '—';
-        }
-        function row(ok, label, msg) {
-          var div = document.createElement('div');
-          div.className = 'row';
-          var b = document.createElement('span');
-          b.className = 'badge ' + (ok ? 'ok' : 'fail');
-          b.appendChild(document.createTextNode(ok ? 'PASS' : 'FAIL'));
-          var l = document.createElement('span');
-          l.className = 'mono';
-          l.appendChild(document.createTextNode(label));
-          var t = document.createElement('span');
-          t.className = 'mono';
-          t.appendChild(document.createTextNode(' — ' + msg));
-          div.appendChild(b);
-          div.appendChild(l);
-          div.appendChild(t);
-          return div;
-        }
-        function renderChecks(list) {
-          var c = $('checks');
-          while (c.firstChild) c.removeChild(c.firstChild);
-          for (var i = 0; i < list.length; i++) c.appendChild(list[i]);
-        }
-        function evaluate() {
-          try {
-            setStatus('');
-            var n = Number($('nInput').value);
-            if (!isInteger(n) || n < 2) {
-              showAnswer('—', []);
-              renderChecks([row(false, 'Input valid', 'n must be an integer ≥ 2')]);
-              return;
-            }
-            var fac = factor(n);
-            var grp = groupPowers(fac);
-            showAnswer(n, grp.list);
-            var checks = [];
-            checks.push(row(product(grp.list) === n, 'Recompose equals n', '∏ primes = n'));
-            checks.push(row(grp.list.every(isPrime), 'All factors are prime', 'each p_i is prime'));
-            var asc = grp.list.slice(1).every(function (v, i) {
-              return v >= grp.list[i];
-            });
-            checks.push(row(asc, 'Canonical order', 'nondecreasing list'));
-            var rebuilt = [],
-              i,
-              j;
-            for (i = 0; i < grp.pairs.length; i++) {
-              for (j = 0; j < grp.pairs[i][1]; j++) {
-                rebuilt.push(grp.pairs[i][0]);
-              }
-            }
-            checks.push(
-              row(
-                JSON.stringify(rebuilt) === JSON.stringify(grp.list),
-                'Prime-power ↔ list agree',
-                'expand powers equals list',
-              ),
-            );
-            var uniq =
-              JSON.stringify(grp.list) ===
-              JSON.stringify(
-                grp.list.slice().sort(function (a, b) {
-                  return a - b;
-                }),
-              );
-            checks.push(row(uniq, 'Uniqueness (order-free)', 'multiset identity'));
-            renderChecks(checks);
-          } catch (e) {
-            setStatus('Error: ' + e.message);
-            showAnswer('—', []);
-            renderChecks([row(false, 'Runtime error', e.message)]);
-          }
-        }
-        function buildHarness() {
-          var H = [
-            { n: 2, title: 'Prime: 2' },
-            { n: 97, title: 'Prime: 97' },
-            { n: 360, title: 'Composite: 360 = 2^3·3^2·5' },
-            { n: 1024, title: 'Power of a prime: 2^10' },
-            { n: 67564329, title: 'n = 67564329' },
-          ];
-          var host = document.getElementById('check');
-          var list = document.createElement('div');
-          list.id = 'hlist';
-          list.className = 'stack';
-          host.appendChild(list);
-          function makeCard(h) {
-            var card = document.createElement('section');
-            card.className = 'card stack';
-            var head = document.createElement('div');
-            head.className = 'row';
-            head.appendChild(document.createElement('strong')).appendChild(document.createTextNode(h.title));
-            var kpi = document.createElement('div');
-            kpi.className = 'kpi';
-            var pf = document.createElement('div');
-            pf.className = 'card';
-            pf.appendChild(document.createTextNode('Prime factors: '));
-            var pfv = document.createElement('span');
-            pfv.className = 'mono';
-            pfv.appendChild(document.createTextNode('—'));
-            pf.appendChild(pfv);
-            kpi.appendChild(pf);
-            var btn = document.createElement('button');
-            btn.appendChild(document.createTextNode('Run'));
-            var checks = document.createElement('div');
-            checks.className = 'stack';
-            btn.onclick = function () {
-              var fac = factor(h.n);
-              var grp = groupPowers(fac);
-              pfv.textContent = grp.list.join(' · ');
-              var L = [];
-              L.push(row(product(grp.list) === h.n, 'Recompose equals n', '∏ primes = n'));
-              L.push(row(grp.list.every(isPrime), 'All factors are prime', 'each p_i is prime'));
-              L.push(
-                row(
-                  grp.list.slice(1).every(function (v, i) {
-                    return v >= grp.list[i];
-                  }),
-                  'Canonical order',
-                  'nondecreasing list',
-                ),
-              );
-              checks.innerHTML = '';
-              for (var i = 0; i < L.length; i++) checks.appendChild(L[i]);
-            };
-            card.appendChild(head);
-            card.appendChild(kpi);
-            card.appendChild(checks);
-            card.appendChild(btn);
-            return card;
-          }
-          for (var i = 0; i < H.length; i++) list.appendChild(makeCard(H[i]));
-          $('runAll').onclick = function () {
-            var btns = list.querySelectorAll('button');
-            for (var i = 0; i < btns.length; i++) btns[i].click();
-          };
-          $('clearChecks').onclick = function () {
-            var c = $('checks');
-            while (c.firstChild) c.removeChild(c.firstChild);
-            var vs = list.querySelectorAll('.mono');
-            for (var i = 0; i < vs.length; i++)
-              if (vs[i].parentNode && vs[i].parentNode.firstChild && vs[i].parentNode.firstChild.nodeType === 3)
-                vs[i].textContent = '—';
-          };
-        }
-        $('factorBtn').onclick = evaluate;
-        $('clearBtn').onclick = function () {
-          $('nInput').value = '67564329';
-          evaluate();
-        };
-        // First render
-        evaluate();
-        buildHarness();
-      })();
-    </script>
-  </body>
-</html>