2 2 k 22^k Dividing 1000!!

Find the largest integer k k such that 2 2 k 1000 ! ! 22^k \mid 1000!! .

Notation: ! ! !! denotes the double factorial notation. For example, 10 ! ! = 10 × 8 × 6 × 4 × 2 10!!=10\times8\times6\times4\times2 .


The answer is 49.

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.

2 solutions

Michael Huang
Dec 10, 2016

By definition of double factorial , 1000 ! ! = 1000 × 998 × × 4 × 2 1000!! = 1000 \times 998 \times \dots \times 4 \times 2 Since each of the terms is divisible by 2 2 , express 1000 ! ! ! 1000!!! as 1000 ! ! = ( 2 × 500 ) × ( 2 × 499 ) × × ( 2 × 2 ) × 2 = 2 500 × 500 ! \begin{array}{rl} 1000!! &= \left({\color{#D61F06}2} \times 500\right) \times \left({\color{#D61F06}2} \times 499\right) \times \dots \times \left({\color{#D61F06}2} \times 2\right) \times {\color{#D61F06}2}\\ &= {\color{#D61F06}2}^{500} \times 500! \end{array} We can apply the following formula ,

d p ( n ! ) = i = 1 log p ( n ) n p i d_p(n!) = \sum\limits_{i=1}^{\lfloor \log_p(n)\rfloor} \left\lfloor \dfrac{n}{p^i}\right\rfloor

for prime number p p

Since there are less terms of large prime numbers (i.e. 11 11 ) than terms of small prime numbers (i.e. 2 2 ) in the prime factorization of factorial numbers, it suffices to determine the value of k k by setting p = 11 p = 11 and n = 500 n = 500 . Then, l o g p ( n ) = 2 \lfloor log_p(n) \rfloor = 2 , which gives d p ( n ! ) = k = 49 d_p(n!) = k = \boxed{49} .

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 ! ) 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 n and prime number p , p, let S p ( n ) { S }_{ p }(n) be the sum of digits of n n in base p , p, and let v p ( n ) v_p(n) be the highest power of p p in n ! . n!. Then, v p ( n ) = n S p ( n ) p 1 . { v }_{ p }(n) = \frac { n - { S }_{ p }(n) }{ p - 1 }.

Pi Han Goh - 4 years, 6 months ago

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. ;)

Michael Huang - 4 years, 6 months ago

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.

Pi Han Goh - 4 years, 6 months ago
Adrien Salem
Dec 10, 2016

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

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...