On Mon, Dec 05, 2005 at 11:59:10PM -0500, Bruce Momjian wrote:
> Tom Lane wrote:
> > It looks like the limit would be about factorial(256).
> >
> > The question remains, though, is this computational range good for
> > anything except demos?
>
> I can say that the extended range is good for finding *printf problems. ;-)
Might anybody be calculating permutations or combinations with the
textbook functions that use factorials? Not a show-stopper since
those calculations can be optimized (at least the basic formulas I
know), but somebody might get bit by the change. Maybe the release
notes could mention the new upper limit of factorial().
--
Michael Fuhr
