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.
As the number of trailing zeros of n ! is given by z n = k = 1 ∑ ⌊ lo g 5 n ⌋ ⌊ 5 k n ⌋ , the number of trailing zeros of a product of factorials is the sum of z n . Therefore, we have:
Z N = n = 1 ∑ 2 0 1 7 z n = n = 1 ∑ 2 0 1 7 k = 1 ∑ ⌊ lo g 5 n ⌋ ⌊ 5 k n ⌋ = n = 1 ∑ 2 0 1 7 ( ⌊ 5 n ⌋ + ⌊ 2 5 n ⌋ + ⌊ 1 2 5 n ⌋ + ⌊ 6 2 5 n ⌋ )
Evaluate the summations separately:
S 1 = n = 1 ∑ 2 0 1 7 ⌊ 5 n ⌋ = ⌊ 5 1 ⌋ + ⌊ 5 2 ⌋ + ⌊ 5 3 ⌋ + ⌊ 5 4 ⌋ + ⌊ 5 5 ⌋ + ⌊ 5 6 ⌋ + ⌊ 5 7 ⌋ + ⌊ 5 8 ⌋ + ⌊ 5 9 ⌋ + ⌊ 5 1 0 ⌋ + ⌊ 5 1 1 ⌋ + ⌊ 5 1 2 ⌋ + ⌊ 5 1 3 ⌋ + ⌊ 5 1 4 ⌋ + ⌊ 5 1 5 ⌋ + ⌊ 5 1 6 ⌋ + ⋯ ⋯ + ⌊ 5 2 0 1 2 ⌋ + ⌊ 5 2 0 1 3 ⌋ + ⌊ 5 2 0 1 4 ⌋ + ⌊ 5 2 0 1 5 ⌋ + ⌊ 5 2 0 1 6 ⌋ + ⌊ 5 2 0 1 7 ⌋ = 0 + 0 + 0 + 0 + 1 + 1 + 1 + 1 + 1 + 2 + 2 + 2 + 2 + 2 + 3 + 3 + ⋯ + 4 0 2 + 4 0 2 + 4 0 2 + 4 0 3 + 4 0 3 + 4 0 3 = n = 1 ∑ ⌊ 5 2 0 1 7 ⌋ − 1 5 n + ( 2 0 1 8 − 5 ⌊ 5 2 0 1 7 ⌋ ) ⌊ 5 2 0 1 7 ⌋ = n = 1 ∑ 4 0 2 5 n + ( 2 0 1 8 − 2 0 1 5 ) 4 0 3 = 2 5 ( 4 0 2 ) ( 4 0 3 + 3 ( 4 0 3 ) = 4 0 6 2 2 4
Similarly,
S 2 S 3 S 4 = n = 1 ∑ 2 0 1 7 ⌊ 2 5 n ⌋ = 2 2 5 ( 7 9 ) ( 8 0 ) + ( 2 0 1 8 − 2 0 0 0 ) 8 0 = 8 0 4 4 0 = n = 1 ∑ 2 0 1 7 ⌊ 1 2 5 n ⌋ = 2 1 2 5 ( 1 5 ) ( 1 6 ) + ( 2 0 1 8 − 2 0 0 0 ) 1 6 = 1 5 2 8 8 = n = 1 ∑ 2 0 1 7 ⌊ 6 2 5 n ⌋ = 2 6 2 5 ( 2 ) ( 3 ) + ( 2 0 1 8 − 1 8 7 5 ) 3 = 2 3 0 4
⟹ Z N = S 1 + S 2 + S 3 + S 4 = 4 0 6 2 2 4 + 8 0 4 4 0 + 1 5 2 8 8 + 2 3 0 4 = 5 0 4 2 5 6