Find the largest n such that 1 0 0 n ∣ 1 0 0 !
Details and Assumptions
a ∣ b means that a is a factor of b
n ! is the factorial function
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.
We know that for any number N which is a multiple of 10, when raised to any number, let's say n , the resulting number ends with zeroes. For N ! , when ( 5 ≤ N ≤ ∞ ) , the resulting numbers end with trailing zeroes. So for 1 0 0 ! , there are 24 trailing zeroes which has the same for 1 0 0 1 2 .
BitOr(100!,100^n) =15
Same method used.
100 factorial has 24 trailing zeroes it is given that 100^n is factor of 100 factorial so n should be equal to 12
same way as I did...
Why 24 trailing zeroes?
Log in to reply
The number of trailing zeroes of a factorial is evaluated using the De Polignac's formula and considering the number of 5 's present in the prime factorization. 2 's aren't considered because there always comes a multiple of 2 before every multiple of 5 .
All we have to do is count the number of 5 ′ s and 2 ′ s in the multiplication. Each pair of 2 and 5 will cause a trailing zero. Since we have only 2 4 5 ′ s , we can only make 2 4 pairs of 2 ′ s and 5 ′ s thus the number of trailing zeros in 1 0 0 ! is 2 4
100! will have 24 zeros. So 1 0 0 n should have 12 zeros. So n is 12
Problem Loading...
Note Loading...
Set Loading...
Firstly, lets find the largest value of k such that 1 0 k ∣ 1 0 0 ! . Now 10 = 2 × 5 and 2 appears far more often than 5, so we just need to find the highest power of 5 that divides 100! (I believe this is known as a one-to-one correspondence). Now M a x k = ∑ i = 1 ∞ ⌊ 5 i 1 0 0 ⌋ = 2 0 + 4 = 2 4 ⇒ 1 0 2 4 ∣ 1 0 0 ! → ∴ 1 0 0 1 2 ∣ 1 0 0 !