The permutation of integers with small least common multiple of two subsequent terms (Q653948)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The permutation of integers with small least common multiple of two subsequent terms |
scientific article; zbMATH DE number 5990901
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The permutation of integers with small least common multiple of two subsequent terms |
scientific article; zbMATH DE number 5990901 |
Statements
The permutation of integers with small least common multiple of two subsequent terms (English)
0 references
20 December 2011
0 references
Improving a result of \textit{P. Erdős, R. Freud} and \textit{N. Hegyvári} [Acta Math. Hung. 41, 169--176 (1983; Zbl 0518.10063)], the authors construct an infinite permutation \(a_1,a_2,\ldots\) of all positive integers with the property that for every \(\varepsilon > 0\) there exists a positive integer \(i_0\) such that \[ [a_i, a_{i+1}] < i\exp \left((2\sqrt{2}+\varepsilon)\sqrt{\log i \log \log i} \right) \] holds for every \(i\geq i_0\). Here \([a_i, a_{i+1}]\) stands for the least common multiple of the consecutive terms \(a_i\) and \(a_{i+1}\).
0 references
permutation of positive integers
0 references
least common multiple
0 references
0.8974488377571106
0 references
0.822547972202301
0 references
0.7424123287200928
0 references
0.7416201233863831
0 references