How many digits does the number 1 0 0 0 ! have?
Note : You might need to use a calculator for the final step in your working.
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.
Sir, Can you please tell how did you do the logarithmic summation?
@Janardhanan Sivaramakrishnan , my question is the same as that of @Swapnil Das . Is there really an efficient method to compute the logarithmic sum by hand?
Log in to reply
Hmm… No response yet.
Log in to reply
I'm pretty sure there isn't any method to calculate the logarithmic sum completely "by hand". The best bet is to just approximate 1 0 0 0 ! first using Stirling's approximation or other unpopular methods . One can also just resort to coding but that wouldn't be doing "by hand".
The number of power to 10 is: l o g 1 0 ( 1 0 0 0 ! = M ∗ l o g ( 1 0 0 0 ) with M = l o g 1 0 1
Applying Stirling's formular one gets: l o g 1 0 ( 1 0 0 0 ! ) = M ∗ ( 0 . 5 l o g 2 ∗ π + 0 . 5 ∗ 1 0 0 0 ∗ l o g 1 0 0 0 − 1 0 0 0 + R n that equals roughly 2 5 6 7 . 6 0 4 6 + M ∗ R n
with R n ≤ 1 2 0 0 0 − 1 , therefore 1000! actually has 2568 digits
Problem Loading...
Note Loading...
Set Loading...
The problem can be solved by hand also.
Number of digits in a number n is equal to ⌊ l o g 1 0 n ⌋ + 1 .
Here we need ⌊ l o g 1 0 ( 1 0 0 0 ! ) ⌋ + 1 = 1 + ⌊ ∑ i = 1 1 0 0 0 l o g 1 0 i ⌋
This gives the answer as 1 + ⌊ 2 5 6 7 . 6 0 4 6 ⌋ = 2 5 6 8