Hostname: page-component-84b7d79bbc-g5fl4 Total loading time: 0 Render date: 2024-07-30T16:38:25.834Z Has data issue: false hasContentIssue false
  • English
  • Français

An Application of a Generalization of Terquem's Problem

Published online by Cambridge University Press:  20 November 2018

Stephen M. Tanny
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).

Type
Research Article
Information
Canadian Mathematical Bulletin , Volume 18 , Issue 5 , 01 December 1975 , pp. 769 - 770
Copyright
Copyright © Canadian Mathematical Society 1975

References

1. Church, C.A. and Gould, H.W., Problem ofTerquem and an extension of Fibonacci numbers, Fibonacci Quarterly 5, (1967), pp. 59-68.Google Scholar
2. Hering, F., A problem on inequalities Am. Math. Monthly, vol. 78, no. 3, March (1971), pp. 275-276.Google Scholar
3. Hering, F., A generalization of the arithmetic-geometric mean inequality and an application to finite sequences of zeros and ones, Israel J. of Math., Vol. II, no. 1 (1972), pp. 14-30.Google Scholar
4. Moser, W. O. J. and Morton, Abramson, Generalizations of Terquem's Problem, J. of Comb. Theory, vol. 7, no. 2, Sept. (1969) pp. 171-180.Google Scholar
5. Riordan, J., An Introduction to Combinatorial Analysis, Wiley, New York, 1958.Google Scholar
6. Tanny, S.M., On alternating subsets of integers, Fibonacci Quarterly (to appear).Google Scholar
7. Tanny, S.M., Generating functions and generalized alternating subsets, Discrete Math, (to appear).Google Scholar
8. quern, O.Ter, Sur un symbole combinatoire d’euler et son utilité dans l'analyse, J. Math. Pures Appl. 4 (1839), pp. 177-184.Google Scholar