Erdős–Mahler question on Diophantine approximation along primes

Determine whether every irrational real number α\alpha has infinitely many primes ℓ\ell such that ∥αℓ∥<ℓ−1\|\alpha\ell\|<\ell^{-1}, where ∥x∥\|x\| denotes the distance from xx to the nearest integer.

References

Progress summary

Refreshed
Claimed progress

A new September 2026 preprint constructs many unusually accurate approximations using primes, but does not settle the broader question.

The Erdős–Mahler question concerns Diophantine approximation restricted to prime indices. The retrieved material does not identify its proposer or original date.

September 2026 prime-progress preprint

The preprint Diophantine approximation with primes in an arithmetic progression claims the bound ∥αℓ−β∥≪vℓ−1/4log⁡8ℓ\|\alpha\ell-\beta\|\ll_v\ell^{-1/4}\log^8\ell in arithmetic progressions and constructs an uncountable family of parameters having infinitely many approximations of order ℓ−1\ell^{-1}. This is a substantive advance, but it does not classify all parameters or settle the full question; the claims remain unverified.

Current status (as of September 2026): The full question remains open, with a substantial but unverified claimed advance from the new prime-arithmetic-progression preprint.

Sources

Solutions 0

No solutions have been posted yet.