When solving math problems, sometimes you end up with very large numbers. To write less on the calculator, they include an exponent key. So when you type " 1 2 5 E 1 5 ", it means 1 2 5 ∗ 1 0 1 5 .
If you calculate 2 0 1 8 ! to be exactly a E b where a and b are positive integers. What the largest possible value of b ? Notation: ! is the factorial notation. For example, 8 ! = 1 × 2 × 3 × ⋯ × 8 .
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.
I like your logic; it is the same as mine. However, you do not need to calculate how many times 2 goes into 2 0 1 8 ! because for every time 5 goes into a number, a 2 goes into 2.5 more times. Therefore, the 5 function will always be the minimum.
First, we need to figure out how many factors of 2018! are multiples of 5 since there are always plenty of 2's to multiply with the 5's to make 10. We get this formula: ⌊ 5 2 0 1 8 ⌋ = 4 0 3
However, that is not the end. Powers of 5, such as 25 125 need to be accounted for. Therefore, we need to add up how many times each of the powers of 5 go into 2018:
n = 1 ∑ ∞ ⌊ 5 n 2 0 1 8 ⌋ = 5 0 2
In general, the amount of trailing zeroes that n ! contains can be represented as
z ( n ) = i = 1 ∑ ∞ ⌊ 5 i n ⌋
Problem Loading...
Note Loading...
Set Loading...
The problem is asking, whats the biggest power of 10 that divides 2 0 1 8 !
If we want to to know the answer, we need to find the number of factors of 2 and 5 in 2 0 1 8 ! because 1 0 = 2 ∗ 5 .
We can se that every multiple of 2 add a factor each, as 4 add one more factor (not two because one was alredy count as a multiple of 2), and 8,16, ...
The same happens with 5, 25, 125, 625, etc.
So the answer is m i n ( ⌊ 2 2 0 1 8 ⌋ + ⌊ 4 2 0 1 8 ⌋ + . . . + ⌊ 1 0 2 4 2 0 1 8 ⌋ , ⌊ 5 2 0 1 8 ⌋ + ⌊ 2 5 2 0 1 8 ⌋ + ⌊ 1 2 5 2 0 1 8 ⌋ + ⌊ 6 2 5 2 0 1 8 ⌋ ) = m i n ( 2 0 1 1 , 5 0 2 ) , so 502 is the answer