Prefer a chat interface with context about you and your work?
An Application of a Generalization of Terquem's Problem
Moser and Abramson [4] proved: given m≥2 and 0≤k l , k 2 , …, k p <m, the number of p -combinations satisfying is 1 ([ x ] denotes the greatest integer ≤x).