On divisibility properties of certain multinomial coefficients (Q1355085): Difference between revisions

Let the sequence \((b_n)\) be defined by \(b_1=2\), \(b_{k+1}= \prod^k_{i=1} b_i + 1\), and put \[ f(n)= n!/(L(n) [n/2]! \dots [n/b_k]! \dots) \] with \(L(n)= \text{lcm} (1,2, \dots, n)\). This function was first introduced by \textit{G. Myerson} [J. Number Theory 48, 80-87 (1994; Zbl 0810.11001)], who showed that \(f\) is integer valued and raised several question about it. \textit{G. Myerson} and \textit{J. W. Sander} [J. Number Theory 61, 67-84 (1996; Zbl 0873.11004)] have shown that \(\log f(n) \sim cn\) (with \(c \approx 0.08 \dots)\) and that \(f(n)\) is odd for exactly 135 values of \(n\). They proved also that \[ N_m(x) \equiv \text{card} \{n\leq x:m \nmid f(n)\} \leq x(C(m) \log_2 \log_2 \log_2x/ (\log_2 \log_2x))^t, \] \(t= \log_2 \log_2 x\), where \(C(m)\) depends only on \(m\). Let \(B_k= \prod^k_{i=1} b_i\) and let \(R_k(m)\) denote the least positive residue of \(m \pmod {B_k}\). The author proves that \(p^a |f(n)\) iff there are exactly \(a\) pairs of integers \((k,s)\) such that \[ R_k ([n/p^s])/B_k <R_{k+1} ([n/p^s])/B_{k+1}; \] and that for any power \(q\) of a prime there exists a constant \(c_q>0\) such that \[ N_q(x) \ll_q x^{1-c_q}. \] This contains a considerable strengthening in this case of the result of Myerson and Sander.