MathGroup Archive 2004

[Date Index] [Thread Index] [Author Index]

Search the Archive


The implementation of PartitionsP uses Euler's pentagonal formula for
small n, and the non-recursive Hardy-Ramanujan-Rademacher method for
larger n.

Does anyone know what "large" means? I speculate that it's n>5000.

  • Prev by Date: Re: Re: bimodal ditribution form counting signs of Pi digits differences
  • Next by Date: Re: Hide Mathematica kernel window
  • Previous by thread: Re: Re: New version, new bugs
  • Next by thread: Re: Hide Mathematica kernel window