Skip to main content
Removed tag additive-combinatorics, which doesn't apply here.
Link
Ira Gessel
  • 17k
  • 1
  • 58
  • 80
Question Protected by Yemon Choi
more informative title
Link
Amir Sagiv
  • 3.6k
  • 1
  • 25
  • 54

Product Sum of all products of k distinct numbersintegers in [1,n]

Source Link
Diger
  • 133
  • 6

Product of k distinct numbers

Let $S=\{1,2,3,...,n\}$ be the set of integers up to $n$ and $p_k(a_1,...,a_k)=a_1\cdots a_k$ the product of $k$ distinct integers $a_1,...,a_k \in S$. There are $\binom{n}{k}$ possibilities to construct such a product $p_k$. I was wondering if it is anyhow possible to estimate the sum of all such $k$-products $p_k$ or similarly the mean value as $n$ is large. Any idea? Thanks