Bounds For The Tail Distribution Of The Sum Of Digits Of Prime Numbers

Let s_q(n) denote the base q sum of digits function, which for n<x, is centered around (q-1)/2 log_q x. In Drmota, Mauduit and Rivat's 2009 paper, they look at sum of digits of prime numbers, and provide asymptotics for the size of the set {p<x, p prime : s_q(p)=alpha(q-1)log_q x} where alpha lies in a tight range around 1/2. In this paper, we examine the tails of this distribution, and provide the lower bound |{p < x, p prime : s_q(p)>alpha(q-1)log_q x}| >>x^{2(1-alpha)}e^{-c(log x)^{1/2+epsilon}} for 1/2<alpha<0.7375. To attain this lower bound, we note that the multinomial distribution is sharply peaked, and apply results regarding primes in short intervals. This proves that there are infinitely many primes with more than twice as many ones than zeros in their binary expansion.Comment: 4 page

Quarkonium Polarization in the NRQCD Factorization Framework

The NRQCD factorization approach for calculating inclusive production of heavy quarkonium gives unambiguous predictions for the polarization of quarkonium states. The factorization formula for polarized states can be obtained by using the threshold expansion method to calculate the short-distance coefficients and then using symmetries of NRQD to reduce the NRQCD matrix elements. A particularly dramatic prediction of the NRQCD factorization framework is that prompt psi's and psi-primes's produced at the Tevatron should be predominantly transversely polarized at large transverse momentum.Comment: 11 pages, LaTeX, invited talk presented at the Quarkonium Physics Workshop, University of Illinois at Chicago, June 199