Skip to main content

Trailing Zeroes of n!

  • Find the number of trailing zeroes in 122! ? 
That's a big number right? The solution is pretty simple. Ask yourself when does any multiplication results in a trailing zero? The answer is (2x5) = 10, leaves one zero behind. The factorial of 122 is a multiplication which you already know. The expansion is,

98750442008336013624115798714482080125644041369
78359605958470050267671457205014364903379642774
50422940710230505796264047365129395968426948958
21378210620013388054747214795243520000000000000
000000000000000


So, we have to find the number of multiples of 5 from the expansion and they are 5 10 15 20 25 30 35 40 45 50 55 60 65 70 75 80 85 90 95 100 105 110 115 120.
So there are 24 multiples of 5.

then again, 25= 5 x 5, which has another extra factor of  5 to count. So how many multiples of 25 from 1 to 122?
(122 / 25) = 4 (taking the only integer)

So, add that 4 to the earlier count. 24 + 4 = 28, so we have 28 trailing zero in 122!

Let's take a number even larger than 122. How about 1001!  ?
 
This time we have to check for multiples of 5, 25 and also 125 ( has extra two factor of 5 ),  625 ( has extra four factors of 5 )

easy calculation: ( 1001 ÷ 5 ) + ( 1001 ÷ 25 ) +  ( 1001 ÷ 125 ) + ( 1001 ÷ 625 )= 200+40+8+1 = 249
So 1001! has 249 trailing zeroes.

This shows a pattern: divide N by powers of 5 until the divisior is greater than N.
and this is a special case of de Polignac's formula .




Labels:

Comments

Post a Comment

Popular posts from this blog

SPOJ - GSS1

Considering input series: { 4 , -10 , 3 , 100 , -20 , 1 } Query(x,y) = Max { a[i]+a[i+1]+...+a[j] ; x ≤ i ≤ j ≤ y } A node contains-  [ START & END is a node's segment limit ] Prefix is the maximum sum starting at START, end can be anywhere. There are two possibilities of the maximum. One, node's leftChild's prefix or two, adding leftChild's sum + rightChild's prefix. (which will make the prefix contiguous) Suffix is the maximum sum ending at END, start can be anywhere. There's two possibility of the maximum. One, node's rightChild's already calculated suffix or two, add rightChild's sum + leftChild's suffix   (which will make the suffix contiguous). Sum : leftChild's sum + rightChild's sum. MAX Maximum of  -  prefix (result is in the node, starts from START but doesn't end in END ) suffix  (result is in the node, doesn't start from START but surely ends in END ) leftChild's max ( result is in left ...
14 comments
Read more

SPOJ 95 - STPAR - Street Parade

Problem Statement Heuristics:   Let, N be the number which is next in fixed order. Take an input X , if it is equal to N then next number will be n++. If not, then search for N in the side lane and after finishing the search, put X in the side lane. After all X is processed but N is not found in either X or side lane, then the order is not possible. Solution:
Post a Comment
Read more

SPOJ-PIGBANK | Unbounded Knapsack ( Minimization)

Unbounded Knapsack : Given a knapsack weight W and a set of N items with certain value Vi and weight W i , we need to calculate minimum amount that could make up this quantity exactly. To have a more clear understanding of this problem, see SPOJ-PIGBANK Sample Problem : We're given a box which can hold maximum W weight. There are N various coins each of value Vi and Weight Wi. We need to fill the box with total W weight with any number of coins of any value. Note that coins are unlimited.  100 ----- W 2 ------- N 1 1 ----- vi,wi 30 50 --- vi,wi Answer of the problem above is, 60. If we take 2 coins of value 30, weight 50, we'll get exactly weight 100 with a minimum value of 60. Algorithm : This is a DP solution. To get the solution for W=100, we'll solve subproblems first. Let dp[W+1]  be an array which will store the subproblems solutions. In the end, dp[W] will give us the minimum amount. Subproblems soultion will be the minimum of taking the coin Vk ...
Post a Comment
Read more