HTML Code

<!DOCTYPE html>
<html lang=en>
<head>
  <meta charset=utf-8>
  <title>Common divisors — gcd</title>
</head>
<body>
  <h1>Gcd then list divisors</h1>
  <p>Output matches the tutorial sample (two lines). Edit the four numbers in the script to experiment.</p>
  <pre id=out></pre>
  <script>
    (function () {
      function gcdNonneg(a, b) {
        while (b !== 0) {
          var t = a % b;
          a = b;
          b = t;
        }
        return a;
      }
      function findCommonDivisorsViaGcd(num1, num2) {
        var a = Math.abs(num1);
        var b = Math.abs(num2);
        var head = "Common divisors of " + num1 + " and " + num2 + " are: ";
        if (a === 0 && b === 0) {
          return head + "(undefined: every nonzero d divides 0)";
        }
        var g = gcdNonneg(a, b);
        var parts = [];
        var i;
        for (i = 1; i <= g; i++) {
          if (g % i === 0) {
            parts.push(String(i));
          }
        }
        return head + parts.join(" ");
      }
      var lines = [];
      lines.push(findCommonDivisorsViaGcd(24, 36));
      lines.push(findCommonDivisorsViaGcd(-12, 18));
      document.getElementById("out").textContent = lines.join("\n");
    })();
  </script>
</body>
</html>

Lines: 0 | Characters: 0

Live Preview Auto-refresh on Run

JavaScript Common Divisors — gcd path (Try It)