Diophantine approximation with integers having no large prime factors
Diophantine approximation with integers having no large prime factors
Kunjakanan Nath,Habibur Rahaman
2026 · ArXiv: 2603.17732
0 Citations
Abstract
Given any irrational number α and a real number κ>0, we show that for any θ<θ0(y), there are infinitely many y-smooth (friable) numbers n such that
∥nα∥<n−θ,where θ0(y)=6/17 if exp((loglogn)2+κ)≤y≤no(1) and θ0(y)=20/59 if no(1)<y≤n. Here ∥x∥ denotes the distance from x to the nearest integer. Our proof is based on the dispersion method together with arithmetic inputs coming from the average bounds for Kloosterman sums over smooth numbers.