A power of 2 meets a factorial

Number Theory Level pending

Find the smallest integer value of n n such that 2 500 2^{500} divides n ! n!


The answer is 508.

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 solution

Calvin Lin Staff
May 13, 2014

If we consider 500 ! , 500!, we can calculate how many of the terms in the product are divisible by 2 k 2^k for each value of k . k.

k 1 2 3 4 5 6 7 8 num 250 125 62 31 15 7 3 1 \begin{array}{|r|cccccccc|} \hline k & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8\\ \hline \mbox{num} & 250 & 125 & 62 & 31 & 15 & 7 & 3 & 1\\ \hline \end{array}

This means that 2 250 + 125 + 62 + 31 + 15 + 7 + 3 + 1 = 2 494 2^{250 + 125 + 62 + 31 + 15 + 7 + 3 + 1} = 2^{494} is the largest power of dividing 500 ! 500! We can factor the next few even numbers 502 = 2 × 251 , 504 = 8 × 63 , 506 = 2 × 253 , 508 = 4 × 127. 502 = 2 \times 251, 504 = 8 \times 63, 506 = 2 \times 253, 508 = 4 \times 127. This tells us that 2 499 2^{499} divides 506 ! 506! (also 507 ! 507! ) and 2 501 2^{501} divides 508 ! 508!

please could you explain how to bring 5 from image (please go to this link for image http://www.sbcrafts.net/clocks/clock-EZ123.jpg) if you wish to explain use my email id which is [email protected]

Mohan Soundappan - 6 years, 4 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...