How many digits are there in 2 0 1 8 ! ?
Note:- - ! denotes factorial
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.
Correction:
It seems to me that there is a small error in your solution:
The number of digits in the decimal expansion of a number m = 0 can be calculated using the formula ⌊ lo g ( m ) ⌋ + 1
This formula is in reality equivalent to the one you have given, except for powers of 10:
For example, for m = 1 0 , your formula gives ⌈ lo g ( 1 0 ) ⌉ = ⌈ 1 ⌉ = 1 .
Log in to reply
Thank you . Please see the corrections.
Problem Loading...
Note Loading...
Set Loading...
The number of digits in a number m can be calculated using the formula ⌊ lo g ( m ) ⌋ + 1
Stirling's approximation for n ! says that n ! ≈ 2 π n ( e n ) n .
Thus number of digits in n ! can be calculated using ⌊ M ⌋ + 1 where, M is 2 lo g ( 2 π n ) + n ⋅ lo g ( n / e )
Putting n = 2 0 1 8 we get the number of digits as 5 7 9 5
Clarification: e is the Euler's number ≈ 2 . 7 1 8 2 8 , ⌊ ⋅ ⌋ is the Greatest Integer or Floor Function