2022/09/15 by F. Petrov, Petrov, F.
Computer Science · Mathematics · #Advanced Mathematical Identities #Analytic Number Theory Research #Coding theory and cryptography #FOS: Mathematics #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2209.07362
openalex publication_date 2022/09/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Landau function g(n) is the maximal possible least common multiple of several positive integers with sum not exceeding n. Under additional assumptions that these numbers are the differences of disjoint bi-infinite arithmetic progressions the maximum is denoted g(n), it was introduced by Okhotin. We find a sharp logarithmic asymptotics of g(n).