{"paper":{"title":"Asymptotic behavior of the least common multiple of consecutive arithmetic progression terms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Guoyou Qian, Shaofang Hong","submitted_at":"2012-04-24T15:41:02Z","abstract_excerpt":"Let $l$ and $m$ be two integers with $l>m\\ge 0$, and let $a$ and $b$ be integers with $a\\ge 1$ and $a+b\\ge 1$. In this paper, we prove that $\\log {\\rm lcm}_{mn<i\\le ln}\\{ai+b\\} =An+o(n)$, where $A$ is a constant depending on $l, m$ and $a$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.5415","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}