Find the highest power of 125 that divides in 1 0 0 ! .
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.
A zero can be formed by the multiplication of 5 and 2. Since 100! contains more than 2's than 5's. We can find the maximum power of 5 contained in 100! ⟹
⌊ 2 1 0 0 ⌋ + ⌊ 4 1 0 0 ⌋ + ⌊ 8 1 0 0 ⌋ + ⌊ 1 6 1 0 0 ⌋ + ⌊ 3 2 1 0 0 ⌋ + ⌊ 6 4 1 0 0 ⌋ = 5 0 + 2 5 + 1 2 + 6 + 3 + 1 = 9 7
⌊ 5 1 0 0 ⌋ + ⌊ 2 5 1 0 0 ⌋ = 2 0 + 4 = 2 4
So, there are 2 4 zero's at the end of 100! ⟹ 3 2 4 = 8 , since 1 2 5 = 5 3
Nice but finding the highest power of 2 is redundant
Please clarify first step, here are all no are not fully divided, What are you telling??
@Dharmendra Singh Hindustani , the first step was rebundant. It was finding the highest power of two and there was a typo, sorry about that. Just look at the second step and on.
Log in to reply
Ok Thanks, But let this step is rebundant for above question. Is this statement is correct?? If yes then tell how 100/8=12 and other next terms??
Log in to reply
Yeah, we are only taking the integer part, I forgot to put the floor function on each term.
Generalizing this:
Q. Find the highest power of k that divides x !
Formula to use:
f ( x ) = a = 1 ∑ ∞ ⌊ k a x ⌋
Using the formula, we have
k = 8
You are finding the exponent of k that divides in x ! , and then you say that k is 8. Moreover, if you will put x = 1 0 0 and k = 1 2 5 , you will get f ( x ) = 0 . Here the need is to put k = 5 ( 1 2 5 = 5 3 ) , and then you will get the exponent of 5 as 2 4 , giving the exponent of 1 2 5 as 8 .
There are 4 multiples of 2 5 and 2 0 multiples of 5 in 1 0 0 ! . This means we could say there 1 6 numbers that are divisible by only 5 and 4 numbers divisible by 5 2 , that is 2 4 5 s in total, or 8 1 2 5 s in the factorial of 1 0 0 .
As we know, 5 1 0 0 = 2 0 , and this means that 1 0 0 ! = 5 2 0 ⋅ a , also we know that 2 5 1 0 0 = 4 so 1 0 0 ! = 2 5 4 ⋅ b . But from the second expression there is 5 4 that weren't considered in the first expression, so we know 1 0 0 ! = 5 2 4 ⋅ c = 1 2 5 8 ⋅ c . So the answer is 8
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Factorials Problem Solving - Intermediate
Note that 1 2 5 = 5 3 , so 1 2 5 n = 5 3 n
We must find the largest n such that 5 3 n ∣ 1 0 0 ! . For this to be true, there must be 3 n powers of 5 in the prime factorization of 1 0 0 ! . As
1 0 0 ! = 1 0 0 ⋅ 9 9 . . . = 2 2 ⋅ 5 2 ⋅ 3 2 ⋅ 1 1 . . .
we count numbers ≤ 1 0 0 whose prime factorization contains 5, as those are the only numbers which will contribute a 5 to the prime factorization of 1 0 0 ! . We count multiples of 25 twice as they contain 5 2 in their prime factorization, and therefore contribute two 5's to the prime factorization of 1 0 0 ! :
5 , 1 0 , 1 5 , 2 0 , 2 5 , 2 5 , 3 0 , 3 5 , 4 0 , 4 5 , 5 0 , 5 0 , 5 5 , 6 0 , 6 5 , 7 0 , 7 5 , 7 5 , 8 0 , 8 5 , 9 0 , 9 5 , 1 0 0 , 1 0 0
We have 24 numbers, which means that 1 0 0 ! contains 5 2 4 in its prime factorization. Therefore,
5 3 n = 5 2 4
n = 8