( 6 ⋅ 1 ) ! = 7 2 0 ( 6 ⋅ 2 ) ! = 4 7 9 0 0 1 6 0 0 ( 6 ⋅ 3 ) ! = 6 4 0 2 3 7 3 7 0 5 7 2 8 0 0 0 From the above, it can be observed that ( 6 ⋅ n ) ! has exactly n trailing zeros. Is it true that ( 6 ⋅ 2 0 1 8 ) ! will have exactly 2 0 1 8 trailing zeros ?
Notation:
!
denotes the
factorial
notation. For example,
8
!
=
1
×
2
×
3
×
⋯
×
8
.
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.
The number of trailing zeros of n ! is given by z ( n ) = k = 1 ∑ ∞ ⌊ 5 k n ⌋ . For n = 6 ⋅ 2 0 1 8 , z ( 6 ⋅ 2 0 1 8 ) > ⌊ 5 6 ⋅ 2 0 1 8 ⌋ = 2 4 2 1 = 2 0 1 8 .
No , ( 6 ⋅ 2 0 1 8 ) ! does not have the exactly 2018 trailing zeros.
As my code worked, It may have 3023 zeroes. So that general case is false.
Simple, we need to calculate number of 5 and 2 pairs in the factorial (essentially number of 5 would do!!!). you will have "at least" a pair with an addition of 6 each time inside the factorial. As you move to fact(6x4), such pairs are 4, while for fact(6x5), it's 6 (6-5's and more than 6 two's) . The pattern doesn't continue even for 5-6s. BTW, you can determine the exact number of zeroes in the factorial.
Problem Loading...
Note Loading...
Set Loading...
This rule will get broken at (6*5)! as zeroes will then be formed by - 10,20,30 each will directly contribute one zero and 5,15 each will contribute one zero as 5 present in their factors will give a zero after multiplying with 2 and 25 will contribute 2 zeroes as it contains two fives as factors. so 3+2+2=7. And hence it goes on increasing as more and more numbers will further contain more fives as their factors hence a single number will be contributing more zeroes therefore upto 2018 it will be greater than 2018.