A refinement of the function \(g(x)\) on Grimm's conjecture (Q1951364)

A previous result of the author asserts that \[ \binom{m+n}{n}=\prod_{i=1}^n a_i \] where \(a_i\mid m+i\) for \(i=1,\ldots,n\) and \(\gcd(a_i,a_j)=1\) for \(1\leq i\neq j\leq n\). A question that is studied in this paper is when one can insure that \(a_i>1\) for all \(i=1,\ldots,n\) in the above representation. The author proves that this is so provided \(m>\prod_{p\leq n} p^{\lfloor \log_p n\rfloor}\), where \(\log_p\) is the base \(p\)-logarithm. The question is related to Grimm's conjecture which asserts that if \(m+1,\ldots,m+n\) are all composite then there are distinct primes \(p_1,\ldots,p_n\) such that \(p_j\mid m+j\) for all \(j=1,\ldots,n\). The proof is elementary with the most sophisticated result needed being Bertrand's postulate. The paper contains a couple of open questions in the spirit of Grimm's conjecture.