Find the number of trailing zeros of the expression 1 1 × 2 2 × 3 3 × ⋯ × 9 7 9 7 × 9 8 9 8 × 9 9 9 9 × 1 0 0 1 0 0 .
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.
+1 for the generalisation! You got my upvote. Hmm, I guess this solution didn't get much attention than others is because there's too much notation. Not that it's a bad thing, but people who solved this need not to know much about sigma notation, pi notation or even logarithms! So they might get intimidated when looking at your solution!
Log in to reply
Yes,you are right,but this solution is interestingly different.I like it.
This is nice,although I don't see the need for such a complication.However if your mind gave this as the 1 st solution to you,then you surely are a genius at variable-concept!I don't know the concepts you used as I am only in 10th grade of Indian Education,but I am interested at your solution and will surely understand it as soon as possible I learn those concepts.Great work!
Its a good solution. Keep it up!
The product P = ∏ k = 1 1 0 0 k k = 2 p 2 × 3 p 3 × 5 p 5 . . . 8 3 × 8 9 × 9 7 , where the latter is the product of prime factors and p n are the power of the prime. Since the number of trailing zeros n z of P comes from 1 0 n z = ( 2 × 5 ) n z . This means that n z is the smaller of p 2 and p 5 or n z = min ( p 2 , p 5 ) . It is obvious that p 2 > p 5 . Therefore, the number of trailing zeros n z = p 5 . Since every one of { 5 , 1 0 , 1 5 , 2 0 , 2 5 , 3 0 , 3 5 , 4 0 , 4 5 , 5 0 , 5 5 , 6 0 , 6 5 , 7 0 , 7 5 , 8 0 , 8 5 , 9 0 , 9 5 , 1 0 0 } contributes 1 power of 5 and { 2 5 , 5 0 , 7 5 , 1 0 0 } contributes an additional 1 power of 5, we have:
n z = k = 1 ∑ 2 0 5 k + k = 1 ∑ 4 2 5 k = 5 × 2 2 0 ( 2 1 ) + 2 5 × 2 4 ( 5 ) = 1 0 5 0 + 2 5 0 = 1 3 0 0
This is a neater solution than that I have in my mind:)
Log in to reply
I am glad that you like it.
I don't see how my solution is different from chew-Seong Cheong
Log in to reply
Your solution is nice indeed,but,what I liked in Chew-Seong Cheong's solution is the summation method,which makes the arithmetic work really simple.You know,I had a solution like yours in my mind(of adding:-5+10+15+20+50........ randomly).I didn't realize the ease of doing this problem's arithmetic work by simply considering summations and then applying formula of sum of first n natural numbers.And I also see that you have nicely cleared the random summation by applying converse of distributive law of numbers.But I see a clean way of writing the answer to this solution by Chew-Seong Cheong.Also,I like the way he wrote the small cute paragraph with a nice explanation.Still you have a nice solution with you.Congrats!
Log in to reply
@Anandmay Patel – Well said!
@Anandmay Patel – I agree with your thoughts
The expression can be written as r = 1 ∏ 1 0 0 r r = 1 1 × 2 2 × ⋯ × 9 9 9 9 × 1 0 0 1 0 0 Equation 1
Since we require only trailing zeros , we need to find the power of 5 in (1) . r must be a multiple of 5 .
i = 1 ∏ 2 0 ( 5 i ) 5 i = 5 5 + 1 0 + 1 5 + 2 0 + 2 5 × 2 + ⋯ + 4 5 + 5 0 × 2 + ⋯ + 7 0 + 7 5 × 2 + ⋯ 9 5 + 1 0 0 × 2 ⟹ 5 5 ( 1 + 2 + 3 + 4 ⋯ + 1 9 + 2 0 ) + 2 5 ( 1 + 2 + 3 + 4 ) Trailing zeroes(Power of 5) : 1 0 5 0 + 2 5 0 = 1 3 0 0
Cleary, the powers of 2 are much more greater than the powers of 5 here, so it is sufficient to say that the we are only looking for the maximum power of 5 that divides the expression.
There are 2 0 natural numbers divisible by 5 on [ 1 , 1 0 0 ] . So, their sum is 5 + 1 0 + 1 5 + . . + 1 0 0 = 1 0 5 0 Next, let us consider those powers of 5 that repeat (i.e. 2 5 = 5 2 , 7 5 = 5 2 ( 3 ) , 5 0 = 5 2 ( 2 ) a n d 1 0 0 = 5 2 ( 4 ) )
Since we already 1 copy each on the latter, we get an answer of 5 + 1 0 + 1 5 + 2 0 + . . . + 1 0 0 + 2 5 + 5 0 + 7 5 + 1 0 0 = 1 3 0 0
Every multiple of 5 give same number of zero with itself, and so do the multiple of 25. So, the number of zero is (5+10+15+...+100)+(25+50+75+100)=1300
Problem Loading...
Note Loading...
Set Loading...
Nice Problem!
Here is my solution.
Notice that every ( 5 k ) 5 k contributes 5 k to the total exponent of 5 ; every ( 5 2 k ) 5 2 k contribute additional 5 2 k to the total exponent of 5 … … … and every ( 5 i k ) 5 i k contribute additional 5 i k to the total exponent of 5 , as long as 5 i k ≤ 1 0 0 .
The same is for any prime p .
Now we can see,
This way, I calculated e = 1 3 0 0 for p = 5 . I was intuitively sure that e ≥ 1 3 0 0 for p = 2 .
So, number for trailing 0 s is 1300 .