Some interesting pages about the factorial function and the gamma function.

• Dick Lipton, Computing the factorial function fast breaks factoring   →
  
  Theorem: If n! can be computed by a straight-line arithmetic computation in O(log^c n) steps, then factoring has polynomial size circuits.