Approximately how many digits does 1 0 0 ! have in base ten?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Answer is 158 as per my coding.
Relevant wiki: Stirling's Formula
The number of digits of 1 0 0 ! is given by:
N = ⌊ lo g 1 0 1 0 0 ! ⌋ + 1 = ⌊ lo g 1 0 2 π ⋅ 1 0 0 ( e 1 0 0 ) 1 0 0 ⌋ + 1 = ⌊ 2 1 lo g 1 0 2 + 2 1 lo g 1 0 π + 1 + 1 0 0 ( 2 ) − 1 0 0 lo g 1 0 e ⌋ + 1 = ⌊ 1 5 7 . 9 7 0 ⌋ + 1 = 1 5 8 Using Stirling’s formula n ! ≈ 2 π n ( e n ) n
Note that 158 is the exact answer and the nearest option is 1 5 0 .
Problem Loading...
Note Loading...
Set Loading...
Given any positive integer n , the number of digits in n is ⌊ lo g 1 0 n ⌋ + 1 . We can compute the exact number of digits in 1 0 0 ! by taking the log base 10. We can then apply the log sum/product rule to re-write this value as a sum:
lo g 1 0 1 0 0 ! = k = 1 ∑ 1 0 0 lo g 1 0 k
The exact value can be obtained with a computer, but our goal is just to estimate. We obtain a minimum and maximum value this number could be. Make the following observations:
We can round down each lo g 1 0 k to the nearest integer to obtain a minimum estimated sum:
( 0 × 9 ) + ( 1 × 9 0 ) + ( 2 × 1 ) = 9 2 .
We can likewise obtain a maximum estimated sum by rounding up each lo g 1 0 k to the nearest integer:
( 0 × 1 ) + ( 1 × 9 ) + ( 2 × 9 0 ) = 1 8 9 .
The actual value of the sum must be between 92 and 189. It doesn't make much sense to estimate 100 because that is so close to our minimum. And so, our estimation is 150.
The actual number of digits in 1 0 0 ! (computed from the sum of logarithms above) is 158.