3
$\begingroup$

I'm looking for a simple identity for the formula:

$$ \sum_{k = 0}^{p} \binom{p}{k} \cdot k! \cdot x^k $$

In words, I have $p$ "players" who can choose to play or not (every player is represented by a unique id). Those who chose to play are lined up in all possible orders. Then every playing player picks an element out of $x$ possibilities (with repetition allowed), in addition to his id.

How many sequences can we get? Is there a simple solution for this series? If not, what is the closest upper limit you can think of?

I haven't touched combinatorics for a long time, so there could be a simple identity that I'm missing...

$\endgroup$
2
$\begingroup$

https://mathoverflow.net/questions/129099/identity-of-binomial-series-with-factorial/129112#129112

There is no "simple" solution: $$ \sum_{k=0}^{p} \binom{p}{k} \cdot k! \cdot x^k = \sum_{k=0}^{p} \frac{p!}{(p-k)!} \cdot x^k \underset{k' = p-k}{=} \sum_{k=0}^{p} \frac{p!}{k!} \cdot x^{p-k} = p!\cdot x^p \underbrace{\sum_{k=0}^{p} \frac{\left(\frac{1}{x}\right)^k}{k!}}_ {\underset{p \to \inf}{\rightarrow} e^{1/x}} \leq p! \cdot x^p \cdot e^{{}^\frac{1}{x}} $$

$\endgroup$
0
$\begingroup$

After calculating a few easy examples, I strongly doubt if any such thing can be accomplished.

You can rewrite the formula as $$\sum_{k = 0}^{p} \binom{p}{k} \cdot k! \cdot x^k = \sum_{k = 0}^{p}\frac{p!}{(p-k)!}x^k = 1+px+p(p-1)x^2+\ldots+p!x^p.$$

It is fairly obvious that this increases terribly fast, which makes me doubt any upper bound, but maybe there exists one. Also, it feels a bit like a Taylor series where accidentally the reciproces of the coefficients have been written, which basically makes me doubt any nice expression.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.