Large values of n! are occasionally needed.
It may be impractical or too time consuming to calculate them
by direct multiplication.
A typical example might be when the Bureau of Fisheries asked
Bell Labs for help finding the shortest route for getting
samples from 300 locations in the Gulf of Mexico.
There are 300! different possible routes.
This is also known as the
travelling salesman problem.
Calculuate values for 50!, 100!, 200!, and 300! as described below
and compare with offical results. (Give percentage error:
(Observed-Expected)/Expected×100%.
n!=10K where
K=(n+0.5)log10n - 0.43429448n + 0.39908993.
Note that this is
Stirling's approximation
(log n!
(n+½)log n - n + ½log(2
))
converted to log10.
Be sure to use all the significant digits since three or four will be lost
in the exponent.
50! = 3.0414 x 1064
100! = 9.33262 x 10157
200! = 7.88658 x 10374
300! = 3.06058 x 10614