Message Boards Message Boards


Combinations preserving ordering

Posted 9 years ago
1 Reply
0 Total Likes

Hi. I am doing some work in natural language processing and am trying to work out a combinatory formula. I want to determine a general formula for:

How many combinations of subgroups size k are there for a group of size n that preserve the order in n?

E.g. How many groups of 5 numbers are there between 1 and 100 that are in ascending order?

I know for many this will be basic but my combinatorics is really rusty. Any advice much appreciated. C.

POSTED BY: Cameron Smith
POSTED BY: Priyan Fernando
Reply to this discussion
Community posts can be styled and formatted using the Markdown syntax.
Reply Preview
or Discard

Group Abstract Group Abstract