number of partitions bench mark

[Robert Gerbicz]

2008/5/13 Joshua Zucker <joshua.zucker at gmail.com>:

> I didn't try Mathematica but it was the work of only a few minutes in
> DrScheme to write the pentagonal number recurrence.  I'd share the
> source code but I used an ugly hack - I precomputed the pentagonals up
> to a large enough value and precomputed the signs to go with them, and
> then just hacked away at the recursion, using memoization to avoid
> recomputing old values in the recurrence.  So, ugly code.


In fact you don't need to write a program for that, because one of the
famous Ramanujan congurence identity says, that numbpart(5*k+4)==0 mod 5, so
numbpart(11269)=...851==1 mod 5 can't be true.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20080513/5eafd5a5/attachment.htm>