Inverse factorial improved

A couple years ago I wrote about how to compute the inverse of factorial. I used that code in writing the previous post because the post required solving the equation ⌊log2(n!)⌋ ≥ b given b. That is, given a number of bits b, find the smallest value of n such that n! ≥ 2b. What the [ ] The post Inverse factorial improved first appeared on John D. Cook .