No label defined (Q3328600)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3859204
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3859204

      Statements

      1982
      0 references
      unsolved problems
      0 references
      prime factorization
      0 references
      binomial coefficient
      0 references
      0 references
      [For part I, cf. the author and \textit{R. L. Graham}, Fibonacci Q. 14, 348--352 (1976; Zbl 0354.10010).] This paper contains some results and unsolved problems concerning the prime factorization of the binomial coefficient \(\binom{n}{k}\). Let \(V(n,k)\) be the contribution of prime powers \(p^a\) to \(\binom{n}{k}\) with \(k<p\leq n-k\). It is proved that if \(m(n)\) denotes the greatest number satisfying \(V(m(n),k)\leq V(n,k)\) then \(m(n)\gg n^{1+1/k}.\) Let \(f(k)\) resp. \(F(k)\) be the smallest resp. greatest number satisfying \(\omega\left(\binom{f(k)}{k}\right)\geq k\) resp. \(\omega\left(\binom{F(k)}{k}\right)<k.\) Is it true that \(F(k)>f(k)?\) Is it true that \(\log f(k) = (1+o(1)) e \log k\)? It is proved that \(F(k)\leq A_k\), where \(A_k\) is the smallest common multiple of the integers up to \(k\). Is it true that \(F(k)<\exp((1-c)k)?\)
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references