http://code.activestate.com/recipes/tags/schorn/top/2010-12-22T00:05:45-08:00ActiveState Code Recipes2010-12-22T00:05:45-08:00Jason Schornhttp://code.activestate.com/recipes/users/4176312/http://code.activestate.com/recipes/577512-gcd-of-an-arbitrary-list/

<p style="color: grey"> Python recipe 577512 by <a href="/recipes/users/4176312/">Jason Schorn</a> (<a href="/recipes/tags/arbitrary/">arbitrary</a>, <a href="/recipes/tags/common/">common</a>, <a href="/recipes/tags/divisor/">divisor</a>, <a href="/recipes/tags/gcd/">gcd</a>, <a href="/recipes/tags/greatest/">greatest</a>, <a href="/recipes/tags/list/">list</a>, <a href="/recipes/tags/schorn/">schorn</a>). </p> <p>Given an arbitrary list (of length &gt;= 1) of positive integers, return the greatest common divisor (<code>gcd</code>) of the list.</p>