Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T06:21:38.679Z Has data issue: false hasContentIssue false
  • English
  • Français

One-to-one functions on the positive integers

Published online by Cambridge University Press:  14 July 2016

Gedalia Ailam and
Mahabanoo N. Tata
Gedalia Ailam
Affiliation:
Michigan State University
Mahabanoo N. Tata
Affiliation:
Michigan State University
Get accessRights & Permissions [Opens in a new window]

Extract

Let {an } be an increasing sequence of positive integers and let be the family of all functions from the positive integers into the positive integers, which satisfy Assume that are random functions with probabilities and for all n > 1 and 0 elsewhere, i.e., all permissible values of f, given the past, are equally likely.

Information

Type
Short Communications
Information
Journal of Applied Probability , Volume 7 , Issue 2 , August 1970, pp. 505 - 507
Copyright
Copyright © Applied Probability Trust 1970 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1] Neuts, M. F. (1968) Are many functions on the positive integers one-to-one? Math. Magazine 41, 103–109.CrossRefGoogle Scholar
[2] Rényi, A. (1962) Théorie des éléments saillants d'une suite d'observations. Colloquium on Combinatorial Methods in Probability Theory. Math. Inst., Aarhus Univ., Denmark.Google Scholar
[3] LoéVe, M. (1963) Probability Theory. 3rd ed. Van Nostrand, Princeton.Google Scholar