How many digits does 2 5 0 ⋅ 5 0 ! 1 0 0 ! contain?
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.
@Staff: That's 100! Thanks :)
I've updated the problem statement. Can you write up your solution? Thanks!
Log in to reply
The first thing to do here is to prove that the expression is an integer. Next, Observe that 100!/50!=100P50.. thus, we are left with 100 99 98...51. It can be shown that 2^50 exactly divides the remaining expression, so.. floor(log(ans)+1)=79
Log in to reply
How 2^50 divides it ??
Log in to reply
@Chirayu Bhardwaj – No of divisors of 2 in 1 0 0 ! is given by [ 2 1 0 0 ] + [ 4 1 0 0 ] + [ 8 1 0 0 ] + [ 1 6 1 0 0 ] + [ 3 2 1 0 0 ] + [ 6 4 1 0 0 ] ,where [.] Is greatest integer function. On calculating it will be 5 0 + 2 5 + 1 2 + 6 + 3 + 1 similarly we can calculate this for 5 0 ! it will be 2 5 + 1 2 + 6 + 3 + 1 upon subtracting both we will get 5 0 which shows 2 5 0 is a factor of it...
Log in to reply
@Atul Shivam – Atul Shivam can u exlpain me again with whole process again pls :)
Can u please clarify what you have did in last step
Problem Loading...
Note Loading...
Set Loading...
Update:
to find the number of digits, you can just use logarithms.
That is,
number of digits of 2 5 0 ⋅ 5 0 ! 1 0 0 ! = lo g 1 0 2 5 0 ⋅ 5 0 ! 1 0 0 ! + 1 = lo g 1 0 1 0 0 ! − lo g 1 0 2 5 0 − lo g 1 0 5 0 ! + 1 = 7 9