Priyamvad Srivastav

activity

20152025

most citedOn Selberg's approximation to the twin prime problem

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

math.NT2025

Log-free bounds on exponential sums over primes

Priyamvad Srivastav

We establish completely log-free bounds for exponential sums over the primes and the Möbius function. Let $0 < η \leq 1/10$ , and suppose $α = a / q + δ / x$ , with $(a, q) = 1$ and $|δ| \leq x…

math.NT2015★ 1 cited

On Selberg's approximation to the twin prime problem

R. Balasubramanian, Priyamvad Srivastav

In his Classical approximation to the Twin prime problem, Selberg proved that for $x$ sufficiently large, there is an $n \in (x, 2 x)$ such that $2^{Ω (n)} + 2^{Ω (n + 2)} \leq λ$ with $λ=…