Abstract:Erdős and Hall defined a pair $(m, n)$ of positive integers to be interlocking, if between any pair of consecutive divisors (both larger than $1$) of $n$ (resp. $m$) there is a divisor of $m$ (resp. $n$). A positive integer is said to be separable if it belongs to an interlocking pair. We prove that the lower density of separable powers of two is positive, as well as the lower density of powers of two which are not separable. Finally, we prove that the number of interlocking pairs whose product is equal to the product of the first primes, is finite. We hereby resolve two conjectures by Erdős and Hall.
| Comments: | 5 Pages v2: computerverification (ref. to Lean code) added |
| Subjects: | Number Theory (math.NT) |
| MSC classes: | 11A51 |
| Cite as: | arXiv:2510.19727 [math.NT] |
| (or arXiv:2510.19727v2 [math.NT] for this version) | |
| https://doi.org/10.48550/arXiv.2510.19727 arXiv-issued DOI via DataCite |
From: Stijn Cambie [view email]
[v1]
Wed, 22 Oct 2025 16:16:50 UTC (7 KB)
[v2]
Thu, 21 May 2026 19:31:56 UTC (7 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。