Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Suppose we have list of $n$ integers $i_1,i_2,\ldots, i_n$ , and we choose $k$ integers from it in all possible combinations (i.e., $C^n_k$ combinations). Now for each combination, we multiply chosen $k$ integers, and add the results.

How do I mathematically formulate this? (some form like $ \sum \prod ??? $)

share|cite|improve this question
up vote 1 down vote accepted

Let $I=\{i_1,\ldots,i_n\}$, and let $P_k(I)$ be the set of $k$-element subsets of $I$. Then you're describing $$\sum_{S\in P_k(I)}\prod S$$

share|cite|improve this answer
Is $P_k(I)$ standard notation? Or I need to specify the notation definition when writing in some journal. – anuj919 Jan 4 '13 at 15:24
@anuj919: You should specify. Another notation often found (and in fact more common in the mathematics that I read) is $[I]^k$. In general, if $S$ is any set, and $\kappa$ is any cardinal number, finite or infinite, $[S]^\kappa$ is the set of all subsets of $S$ of cardinality $\kappa$. You’ll also see $[S]^{<\kappa}$ and $[S]^{\le\kappa}$, with the obvious meanings. – Brian M. Scott Jan 4 '13 at 15:29
Thanks for clarification @brian. – anuj919 Jan 4 '13 at 15:32
@anuj919: My pleasure. – Brian M. Scott Jan 4 '13 at 15:32

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

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