Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T22:29:10.357Z Has data issue: false hasContentIssue false

Sieve-Generated Sequences with Translated Intervals

Published online by Cambridge University Press:  20 November 2018

R. G. Buschman
Affiliation:
State University of New York, Buffalo
M. C. Wunderlich
Affiliation:
State University of New York, Buffalo
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.

Consider the following sieve process. Let A(1) be the sequence of integers greater than 1. Let A(n+1) be obtained from A (n) = {a1(n), a2(n), …} by eliminating one element from each of the intervals Ik(n), where

We let an = an(n) and A = {an} be the sequence of integers that survive the sieve. M. C. Wunderlich (8) has found a necessary and sufficient condition for an ∼ n log n and, in a more recent paper, M. Wunderlich and W. E. Briggs (9) have studied a subclass of the sequences defined above for which an ∼ n log n.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1967