Question #81709

(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++x50000x^{500} + x^{500} + \ldots + x^{500} + x^{501} + \ldots + x^{501} + \ldots + x^{50000} + \ldots + x^{50000}) then the solution is following.

There are 100 ways to choose the digit from the first multiplier x+x2++x100x + x^2 + \ldots + x^{100}, 100 ways to choose the digit from the second multiplier, and so on up to 100 ways to choose the digit from the 500th500^{\text{th}} multiplier. Then the total number of ways is


100100100500 times=100500, it is the number of digits.\frac{100 \cdot 100 \cdots 100}{500 \text{ times}} = 100^{500}, \text{ 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 xx in the expansion of (x+x2+x3++x100)500(x + x^2 + x^3 + \ldots + x^{100})^{500} is 500: xxxx=x500x \cdot x \cdot x \cdot \ldots \cdot x = x^{500}, the maximum power of xx in the expansion is 50000: x100x100x100=(x100)500=x50000x^{100} \cdot x^{100} \cdot \ldots \cdot x^{100} = (x^{100})^{500} = x^{50000}.

Let us prove that for any nZn \in \mathbb{Z}: 500n<50000xn500 \leq n < 50000x^n is present in the expansion. We have


(x+x2+x3++x100)500=x500(1+x+x2++x99)500(x + x^2 + x^3 + \ldots + x^{100})^{500} = x^{500}(1 + x + x^2 + \ldots + x^{99})^{500}


Then we have to prove that for any 0m<49500xm0 \leq m < 49500x^m is present in the expansion of (1+x+x2++x99)500(1 + x + x^2 + \ldots + x^{99})^{500}.

Divide mm by 99:


m=99k+lm = 99k + l


where


0k<500,0l<99.0 \leq k < 500, 0 \leq l < 99.


Then xmx^m can be represented as xm=x99x99x99k timesxl1115001k0 timesx^m = \underbrace{x^{99} \cdot x^{99} \cdot \ldots \cdot x^{99}}_{k \text{ times}} \cdot x^l \cdot \underbrace{1 \cdot 1 \cdot \ldots \cdot 1}_{500 - 1 - k \geq 0 \text{ times}}, 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

Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

LATEST TUTORIALS
APPROVED BY CLIENTS