We prove that the unconditional asymptotic formula for the sum of the binomial coefficients over prime numbers holds for almost all . We also establish the bounds on this sum and show that improvements on the lower bound would imply a bound for prime gaps which is stronger than Cramér’s bound conditional on the Riemann Hypothesis.
This is a joint work with Nilotpal Kanti Sinha.