Arithmetical properties of permutations of integers (Q1053743): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q5803354 / rank | |||
Normal rank |
Revision as of 08:59, 14 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Arithmetical properties of permutations of integers |
scientific article |
Statements
Arithmetical properties of permutations of integers (English)
0 references
1983
0 references
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.
0 references
permutations
0 references
density of sums
0 references
least common multiple
0 references
greatest common divisor
0 references