(x^1+x^2+............+x^100)^500 if you apply binomial theorem how many digits there will be
Expert's answer
Answer on Question #81709 – Math– Combinatorics | Number Theory Question
(x^1+x^2+...+x^100)^500 if you apply binomial theorem how many digits there will be
Solution
If by digit is meant any summand and coefficients are not put together (i.e. form x500+x500+…+x500+x501+…+x501+…+x50000+…+x50000) then the solution is following.
There are 100 ways to choose the digit from the first multiplier x+x2+…+x100, 100 ways to choose the digit from the second multiplier, and so on up to 100 ways to choose the digit from the 500th multiplier. Then the total number of ways is
500 times100⋅100⋯100=100500, it is the number of digits.
I thought that the question is about the number of digits which arise as powers (because the binomial theorem gives a form of sum with coefficients).
Then it was my solution:
The minimum power of x in the expansion of (x+x2+x3+…+x100)500 is 500: x⋅x⋅x⋅…⋅x=x500, the maximum power of x in the expansion is 50000: x100⋅x100⋅…⋅x100=(x100)500=x50000.
Let us prove that for any n∈Z: 500≤n<50000xn is present in the expansion. We have
(x+x2+x3+…+x100)500=x500(1+x+x2+…+x99)500
Then we have to prove that for any 0≤m<49500xm is present in the expansion of (1+x+x2+…+x99)500.
Divide m by 99:
m=99k+l
where
0≤k<500,0≤l<99.
Then xm can be represented as xm=k timesx99⋅x99⋅…⋅x99⋅xl⋅500−1−k≥0 times1⋅1⋅…⋅1, thus it is present in the expansion.
Then the number of digits is 50000-500+1=49501 (we add 1 since we need to include both numbers 500 and 50000, and 50000-500 is number of numbers between 500 and 50000 not including 50000).
Answer provided by https://www.AssignmentExpert.com