 is non-zero, the result is the numerically greatest
integer dividing both <code>this</code> and <code>other</code>.</p>
<p>The greatest common divisor is independent of the order,
so <code>x.gcd(y)</code> is  always the same as <code>y.gcd(x)</code>.</p>
<p>For any integer <code>x</code>, <code>x.gcd(x)</code> is <code>x.abs()</code>.</p>
<p>If both <code>this</code> and <code>other</code> is zero, the result is also zero.</p>
    </section>
    
    <section class="summary source-code" id="source">
      