Etude du graphe divisoriel 4
Abstract
We show that there is a permutation f of the positive integers such that for n ≥ 2, l.c.m.(f(n), f(n+1)) ≤ cn( n)2, where c is a positive constant. It improves previous results of Erd\"os, Freud and Hegyvari (1983), and Chen and Ji (2011).
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.