The permutation of integers with small least common multiple of two subsequent terms

DOI10.1007/S10474-011-0099-XMaRDI QIDQ653948zbMATH OpenOpenAlexFDO

Authors Juan-Miguel Gracia

Publication date 20 December 2011

Published in Acta Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10474-011-0099-x

zbMATH Keywords

least common multiplepermutation of positive integers

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Distribution of primes (11N05)

Review text

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}\).

Recommendations

• Arithmetical properties of permutations of integers
• Study of the divisor graph. IV
• scientific article; zbMATH DE number 3747270
• On a multiplicative property of sequences of integers
• Sequences with bounded l.c.m. of each pair of terms II

Cites work

• Applications des entiers à diviseurs denses
• Arithmetical properties of permutations of integers

Cited in

(3)

• Study of the divisor graph. IV
• Permutations with small maximal \(k\)-consecutive sums
• Sur un problème de crible et ses applications. II. Corrigendum et étude du graphe divisoriel

This page was built for publication: The permutation of integers with small least common multiple of two subsequent terms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653948)