A new function associated with the prime factors of (ⁿ_{𝑘})

  • Ecklund E
  • Erdös P
  • Selfridge J
6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free