For how many positive integer k does the ordinary decimal representation of the integer k ! end in exactly 99 zeros ?
By inspection I found that 400 ! end in exactly 99 zeros , but 399 ! does NOT end in 99 zeros ; using the formula number of zeros at the end =∞∑n=1[k5n]where , [x] denotes the greatest integer part not exceeding x.
I also found that, for k=401,402,403,404 the number of zeros is same, but for k=405 the number of zeros increase by 1 ; as 405 is divisible by 5 again , after 400.
Thus I got that there are only 5 integers satisfying the condition which are 400,401,402,403,404.
The question is possible duplicate of this or this but my question is different from these two questions.
Does there exist any other rule or easy formula from where I can get how many integers are there
Answer
Because the number of zeroes steps up at each multiple of 5, the only possible answers are five or zero. So the question might be: How to determine of there exists k such that k! ends in a given number of zeroes?
Say we want m zeroes. So we look for k with
m=f(k):=∞∑i=1⌊k5i⌋
First note that
f(k)<∞∑i=1k5i=k4
and on the other side
f(k)≥⌊log5k⌋∑i=1(k5i−1)>k4−⌊log5k⌋−54>k4−log5k−94
For k≥3, the right hand side of (3) is strictly increasing. Therefore we start our search at k=4m+1 and end it no later than k=4m+4log5(4m+1)+9. Unless m is awfully large, this requires us to try just a few values of k (recall that we only need to try multiples of 5).
No comments:
Post a Comment