Seth Hardy

collaborators

3 papers

math.NT2026

Character sums over smooth numbers

Seth Hardy, Max Wenqiang Xu

Let $Ψ (x, y)$ denote the count of $y$ -smooth numbers below $x$ and $P (n)$ denote the largest prime factor of $n$ . We show that \[ \frac{1}{φ(q)} \sum_{χ\bmod q} \Bigl| \sum_{\substa…

math.NT2025

Helson's conjecture for smooth numbers

Seth Hardy, Max Wenqiang Xu

Let $Ψ (x, y)$ denote the count of $y$ -smooth numbers below $x$ and $P (n)$ denote the largest prime factor of $n$ . We prove that for $f$ a Steinhaus random multiplicative function, t…

math.NT2025

The distribution of partial sums of random multiplicative functions with a large prime factor

Seth Hardy

For $f$ a Steinhaus random multiplicative function, we prove convergence in distribution of the appropriately normalised partial sums \[ \frac{{(\log \log x)}^{1/4}}{\sqrt{x}} \sum…