An Application of a Generalization of Terquem's Problem
Canadian mathematical bulletin, Tome 18 (1975) no. 5, pp. 769-770

Voir la notice de l'article provenant de la source Cambridge University Press

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).
Tanny, Stephen M. An Application of a Generalization of Terquem's Problem. Canadian mathematical bulletin, Tome 18 (1975) no. 5, pp. 769-770. doi: 10.4153/CMB-1975-135-8
@article{10_4153_CMB_1975_135_8,
     author = {Tanny, Stephen M.},
     title = {An {Application} of a {Generalization} of {Terquem's} {Problem}},
     journal = {Canadian mathematical bulletin},
     pages = {769--770},
     year = {1975},
     volume = {18},
     number = {5},
     doi = {10.4153/CMB-1975-135-8},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1975-135-8/}
}
TY  - JOUR
AU  - Tanny, Stephen M.
TI  - An Application of a Generalization of Terquem's Problem
JO  - Canadian mathematical bulletin
PY  - 1975
SP  - 769
EP  - 770
VL  - 18
IS  - 5
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1975-135-8/
DO  - 10.4153/CMB-1975-135-8
ID  - 10_4153_CMB_1975_135_8
ER  - 
%0 Journal Article
%A Tanny, Stephen M.
%T An Application of a Generalization of Terquem's Problem
%J Canadian mathematical bulletin
%D 1975
%P 769-770
%V 18
%N 5
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1975-135-8/
%R 10.4153/CMB-1975-135-8
%F 10_4153_CMB_1975_135_8

[1] 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] 2. Hering, F., A problem on inequalities Am. Math. Monthly, vol. 78, no. 3, March (1971), pp. 275-276. Google Scholar

[3] 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] 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] 5. Riordan, J., An Introduction to Combinatorial Analysis, Wiley, New York, 1958. Google Scholar

[6] 6. Tanny, S.M., On alternating subsets of integers, Fibonacci Quarterly (to appear). Google Scholar

[7] 7. Tanny, S.M., Generating functions and generalized alternating subsets, Discrete Math, (to appear). Google Scholar

[8] 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

Cité par Sources :