If I have k positive integers, x1, x2, ..., xk and n(also an integer) where(adsbygoogle = window.adsbygoogle || []).push({});

$$ 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.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# B Combinatorics problem

Have something to add?

Draft saved
Draft deleted

Loading...

Similar Threads for Combinatorics problem |
---|

I Combinatorics & probability density |

I The Halting Problem |

B Problem in Counting - Number of Passwords |

I A specific combination problem |

B Arranging blocks so that they fit together |

**Physics Forums | Science Articles, Homework Help, Discussion**