UPDF AI

Diophantine approximation with integers having no large prime factors

Kunjakanan Nath,Habibur Rahaman

2026 · ArXiv: 2603.17732
0 Citations

Abstract

Given any irrational number α\alpha and a real number κ>0\kappa>0, we show that for any θ<θ0(y)\theta<\theta_0(y), there are infinitely many yy-smooth (friable) numbers nn such that

∥nα∥<n−θ,\|n\alpha\|<n^{-\theta},

where θ0(y)=6/17\theta_0(y)=6/17 if exp⁡((log⁡log⁡n)2+κ)≤y≤no(1)\exp((\log\log n)^{2+\kappa})\leq y\leq n^{o(1)} and θ0(y)=20/59\theta_0(y)=20/59 if no(1)<y≤nn^{o(1)}<y\leq n. Here ∥x∥\|x\| denotes the distance from xx 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.