Séminaire Lotharingien de Combinatoire, B15i (1986), 4 pp.
[Formerly: Publ. I.R.M.A. Strasbourg, 1987, 340/S-15, p.
5-8.]
Gerd Baron
Ein Problem vom Erdős-Typus
Abstract.
We consider the following problem:
let F(n;<ak>) be a function which,
for all sequences <ak> with f(<ak>)
≤ g(n), attains integer values. Furthermore, let
E be a set of sequences <ak>. We want
to find
e(n) = sup {<ak> ∈ E,
F(n;<ak>) ∈ N}.
The following version is available: