Let g ( k ) g(k) denote the least integer > k + 1 > k + 1 so that all the prime factors of ( g ( k ) k ) \left ( {\begin {array}{*{20}{c}} {g(k)} \\ k \\ \end {array} } \right ) are greater than k . The irregular behavior of g ( k ) g(k) is studied, obtaining the following bounds: k 1 + c > g ( k ) > exp ( k ( 1 + o ( 1 ) ) ) . {k^{1 + c}} > g(k) > \exp \,(k(1 + o(1))). Numerical values obtained for g ( k ) g(k) with k ≦ 52 k \leqq 52 are listed.
CITATION STYLE
Ecklund, E. F., Erdös, P., & Selfridge, J. L. (1974). A new function associated with the prime factors of (n_{𝑘}). Mathematics of Computation, 28(126), 647–649. https://doi.org/10.1090/s0025-5718-1974-0337732-2
Mendeley helps you to discover research relevant for your work.