- #1
Mayan Fung
- 131
- 14
If I have k positive integers, x1, x2, ..., xk and n(also an integer) where
$$ x_1≤x_2≤x_3≤...≤x_k≤n $$
How can I get the total combinations? I am trying to find the distinct components of a symmetric tensor. But I stuck here.
$$ x_1≤x_2≤x_3≤...≤x_k≤n $$
How can I get the total combinations? I am trying to find the distinct components of a symmetric tensor. But I stuck here.