On the number of prime factors of summands of partitions (Q2433579): Difference between revisions

The three principal results of this paper show that ``for almost all partitions of an integer the sequence of parts satisfies similar arithmetic properties as the sequence of natural numbers.'' For example, let \(\Phi\) be a non-decreasing function with \[ \lim_{N \to \infty} \Phi(N) = + \infty. \] For \(n \to \infty\), for all but \(o(p(n))\) partitions of \(n\), the number of parts \(\gamma_j\) with \[ | \omega(\gamma_j) - \log \log n| > \Phi(n)\sqrt{\log \log n} \] is \(o(\sqrt{n}\log n)\). Here the \(\gamma_j\) are the parts of a partition \(\gamma = (\gamma_1,\dots,\gamma_s)\) of \(n\), and \(\omega(m)\) is the number of distinct prime factors of \(m\). The analytic and probabilistic methods are applications/extensions of the authors' previous work [Acta Math. Hung. 110, No. 4, 323--335 (2006; Zbl 1121.11070)].