Resolution of two conjectures by Erdős and Hall concerning separable numbers

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.

arXiv comment5 Pages v2: computerverification (ref. to Lean code) added