Find the largest integer k such that 2 2 k ∣ 1 0 0 0 ! ! .
Notation: ! ! denotes the double factorial notation. For example, 1 0 ! ! = 1 0 × 8 × 6 × 4 × 2 .
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.
Wonderful exposition!
We can apply the following formula ,
This is more commonly known as the De Polignac's formula .
Alternatively, you can evaluate d p ( n ! ) using the theorem below (courtesy of another wiki page ):
An alternative way to compute the trailing zeros of a factorial is given by analyzing the number in a different prime base .
Given an integer n and prime number p , let S p ( n ) be the sum of digits of n in base p , and let v p ( n ) be the highest power of p in n ! . Then, v p ( n ) = p − 1 n − S p ( n ) .
Log in to reply
Wow! You have given lots of feedbacks for my solutions so far. Greatly appreciate them! :D
Though I'm not much of the "shortcut" person, I do look for possible patterns.
By the way, the link to De Polignac's formula doesn't work. ;)
Log in to reply
I like reading your solutions because they are super duper neat and easy to read. I just like to offer insights to alternative approaches/interpretations. Keep it up man! ;)
The link has been fixed. Thanks.
In 1000!! there are :
1000 / 22 = 45 multiples of 22
1000 / 22^ 2 = 2 multiples of 22^ 2
1000 / 22^ 3 < 1 hence no multiple of 22 ^ n with n > 2
Moreover, since 22 = 2 × 11, we must also consider multiples of 11 different from those of 22 already counted :
1000 / 11^ 2 = 8 which we have to divide by 2 to get the even ones and by 2 again to leave out the multiples of 22 ^ 2 which gives us 2
Same as with 22, there are no multiples of 11^ n smaller than 1000 with n > 2
Hence we end up with : k = 45 + 2 + 2 = 49
Problem Loading...
Note Loading...
Set Loading...
By definition of double factorial , 1 0 0 0 ! ! = 1 0 0 0 × 9 9 8 × ⋯ × 4 × 2 Since each of the terms is divisible by 2 , express 1 0 0 0 ! ! ! as 1 0 0 0 ! ! = ( 2 × 5 0 0 ) × ( 2 × 4 9 9 ) × ⋯ × ( 2 × 2 ) × 2 = 2 5 0 0 × 5 0 0 ! We can apply the following formula ,
Since there are less terms of large prime numbers (i.e. 1 1 ) than terms of small prime numbers (i.e. 2 ) in the prime factorization of factorial numbers, it suffices to determine the value of k by setting p = 1 1 and n = 5 0 0 . Then, ⌊ l o g p ( n ) ⌋ = 2 , which gives d p ( n ! ) = k = 4 9 .