H. Helfgott

activity

19982025

most citedMinor arcs for Goldbach's problem

50 citations · 353 across the 37 of their papers we have counts for

collaborators

Showing 2021 · math.NTShow all

2 papers · 2 filters

math.NT2021★ 3 cited

Expansion, divisibility and parity

Harald Andrés Helfgott, Maksym Radziwiłł

Let $P \subset [H_{0}, H]$ be a set of primes, where $lo g H_{0} \geq (lo g H)^{2/3 + ε}$ . Let $L = \sum_{p \in P} 1/ p$ . Let $N$ be such that $\log H \leq (\…

math.NT2021

Summing $μ (n)$ : a faster elementary algorithm

Harald A. Helfgott, Lola Thompson

We present a new elementary algorithm that takes \[ \mathrm{time} \ \ O_ε\left(x^{\frac{3}{5}} (\log x)^{\frac{3}{5}+ε} \right) \ \ \mathrm{and}\ \ \mathrm{space} \ \ O\left(x^{\fr…

Expansion, divisibility and parity

Summing μ(n): a faster elementary algorithm

Summing $μ (n)$ : a faster elementary algorithm