Hostname: page-component-7b7567c8c-slfcl Total loading time: 0 Render date: 2026-11-19T08:09:40.405Z Has data issue: false hasContentIssue false

Asymptotic Expansions

Published online by Cambridge University Press:  20 November 2018

Leo Moser
Affiliation:
University of Alberta
Max Wyman
Affiliation:
University of Alberta
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.

1. Introduction. Let a1 a2, …, am be a set of real non-negative numbers and let

1.1 P(x) = a1x + a2x2 + … + amxm (am ≠ 0).

Many combinatorial problems can be reduced to the study of numbers Bn generated by

1.2 .

Some problems of this type were treated by Touchard (7), Jacobsthal (3), Chowla, Herstein, Moore and Scott (1; 2), and the present authors (4).

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1956