note 53442 added to ref.math

If you're really concerned about speed, you could compute the factorial of large numbers using the Gamma function of n-1. Integral y^(t-1)*Exp(-y) for y from 0 to Infinity For Fibonacci numbers, there's a better-than-recursive way. ((1+sqrt(5))/2)^(n/sqrt(5)) - ((1-sqrt(5))/2)^(n/sqrt(5)) ---- Manual Page -- http://www.php.net/manual/en/ref.math.php Edit -- http://master.php.net/manage/user-notes.php?action=edit+53442 Delete: added to the manual -- http://master.php.net/manage/user-notes.php?action=delete+53442&report=yes&reason=added+to+the+manual Delete: bad code -- http://master.php.net/manage/user-notes.php?action=delete+53442&report=yes&reason=bad+code Delete: spam -- http://master.php.net/manage/user-notes.php?action=delete+53442&report=yes&reason=spam Delete: useless -- http://master.php.net/manage/user-notes.php?action=delete+53442&report=yes&reason=useless Delete: other reasons -- http://master.php.net/manage/user-notes.php?action=delete+53442&report=yes Reject -- http://master.php.net/manage/user-notes.php?action=reject+53442&report=yes Search -- http://master.php.net/manage/user-notes.php