Number Theory Problem No.6

Find the smallest number n n such that n ! n! has 250000000 250000000 trailing zeroes . Given that all numbers are written in base 10.


The answer is 1000000010.

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

Since the factors 5 and 2 are needed to make a trailing zero, we can take the floor function of how many times the powers of 5 divide n n (since they are less common than powers of 2):

250000000 = i = 1 l o g 5 n n 5 i \displaystyle 250000000 = \sum_{i=1}^{⌊log_{5}n⌋} ⌊\frac{n}{5^{i}}⌋

Solving the above equation (which is very difficult to me) results in 1000000009 < n < 1000000014 1000000009 < n < 1000000014 with n N n \in \N . So the answer is n m i n = 1000000010 n_{min}=\boxed{1000000010} .

A good way to approximate the answer is using:

A = i = 1 l o g 5 n n 5 i n 4 \displaystyle A = \sum_{i=1}^{⌊log_{5}n⌋} ⌊\frac{n}{5^{i}}⌋ \approx \frac{n}{4}

With n = 1 0 9 n=10^9 , A = 249999998 < 250000000 A=249999998 < 250000000 , so you would start counting upward.

The summation is approximately less than n/5+n/25+n/125+....=n/4, so you would start guessing n=1000000000

Isaac YIU Math Studio - 9 months, 2 weeks ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...