Papers
Topics
Authors
Recent
Search
2000 character limit reached

Diophantine approximation with integers having no large prime factors

Published 18 Mar 2026 in math.NT | (2603.17732v1)

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((\log\log n){2+κ})\leq y\leq n{o(1)}$ and $θ_0(y)=20/59$ if $n{o(1)}<y\leq 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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.