http://code.activestate.com/recipes/tags/factorial-zero/2014-03-08T13:09:41-08:00ActiveState Code Recipes2014-03-08T13:09:41-08:00Johnhttp://code.activestate.com/recipes/users/4189390/http://code.activestate.com/recipes/578848-factorial/

<p style="color: grey"> Python recipe 578848 by <a href="/recipes/users/4189390/">John</a> (<a href="/recipes/tags/factorial/">factorial</a>, <a href="/recipes/tags/loop/">loop</a>, <a href="/recipes/tags/loops/">loops</a>, <a href="/recipes/tags/math/">math</a>, <a href="/recipes/tags/range/">range</a>, <a href="/recipes/tags/simple/">simple</a>). </p> <p>Just a simple factorial program I made in Python 3.</p>

2013-08-10T03:40:02-07:00Samuel James Ericksonhttp://code.activestate.com/recipes/users/4187478/http://code.activestate.com/recipes/578632-de-polignacs-formula/

<p style="color: grey"> Python recipe 578632 by <a href="/recipes/users/4187478/">Samuel James Erickson</a> (<a href="/recipes/tags/factorial/">factorial</a>, <a href="/recipes/tags/n/">n</a>, <a href="/recipes/tags/prime/">prime</a>, <a href="/recipes/tags/primes/">primes</a>). Revision 4. </p> <p>Obtains the total number of factors of p in n! for any prime p.</p>

2010-05-23T16:06:33-07:00Ivo Danihelkahttp://code.activestate.com/recipes/users/4168810/http://code.activestate.com/recipes/577241-faster-factorial/

<p style="color: grey"> Python recipe 577241 by <a href="/recipes/users/4168810/">Ivo Danihelka</a> (<a href="/recipes/tags/factorial/">factorial</a>). Revision 3. </p> <p>If you are calling factorial() many times, it is worth to cache the computed factorials.</p>