Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T23:14:05.957Z Has data issue: false hasContentIssue false

An Application of a Generalization of Terquem's Problem

Published online by Cambridge University Press:  20 November 2018

Stephen M. Tanny*
Affiliation:
Department of Mathematics, University of Toronto
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Moser and Abramson [4] proved: given m≥2 and 0≤kl, k2, …, kp<m, the number of p-combinations

satisfying

is

1

([x] denotes the greatest integer ≤x).

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1975