Arithmetical properties of permutations of integers (Q1053743): Difference between revisions

Let \(a_1,\dots,a_n\) be a permutation of \(1,\dots,n\) and let \([a_i,a_j]\) denote the least common multiple of \(a_i\) and \(a_j\). It is shown that \[ \min\max_{1\leq i< n}[a_i,a_{i+1}]=(1+o(1))\frac{n^2}{4\log n}, \] where the minimum is taken over all permutations. This result is best possible since in any permutation there must be an \(a_i\) such that \([a_i,a_{i+1}]\geq(1+o(1))\frac{n^2}{4\log n}\). It is also shown that there is an infinite permutation \(a_1,a_2,\dots\) of the positive integers such that \[ [a_i,a_{i+1}]< ie^{c\sqrt{\log i}\log\log i} \] for all i. Some results are also obtained for the greatest common divisor. See also following review.