An Extremal Problem in Number Theory (Q5528778)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3241430
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An Extremal Problem in Number Theory |
scientific article; zbMATH DE number 3241430 |
Statements
An Extremal Problem in Number Theory (English)
0 references
1967
0 references
extremal problem
0 references
0.8231871128082275
0 references
0.8111047148704529
0 references
Given integers \(n, k\), such that \(n\geq k\geq 3\). Let \(f(n,k)\) denote the largest positive integer for which there exists a set of \(f(n,k)\) distinct integers \(\leq n\), no \(k\) members of them having pairwise the same highest common factor. \textit{P. Erdős} [Mat. Lapok 17, 135--155 (1966; Zbl 0146.27201)] has obtained upper and lower bounds for \(f(n,k)\) in the case when \(k\) is fixed. The authors consider \(k\) increasing with \(n\), and prove that, if \(\varepsilon>0\) and \(\alpha>0\) are given, then \[ n^{\alpha/(1+\alpha)-\varepsilon}<f(n,[\log^\alpha n])< n^{(2\alpha+3)/(2\alpha+4)+\varepsilon} \] provided \(n>n_0(\alpha,\varepsilon)\). The lower bound is obtained by exhibiting a suitable set of integers, and the upper bound by an extension of the method of Erdős. A lower bound for \(f(n,[n^{1/t}])\) is also obtained, \(t\geq 2\), and some related unsolved problems are mentioned.
0 references