Smooth numbers in short intervals conjecture

From papers

For real x,yx,y, let Ψ(x,y)\Psi(x,y) denote the number of positive integers at most xx all of whose prime factors are at most yy. Such integers are called yy-smooth numbers. Let ϵ>0\epsilon>0. Smooth numbers in short intervals conjecture. For sufficiently large xx,

Ψ(x+xϵ,xϵ)Ψ(x,xϵ)xϵ.\Psi(x+x^\epsilon,x^\epsilon)-\Psi(x,x^\epsilon)\gg x^\epsilon.

This predicts that every sufficiently large interval of length xϵx^\epsilon contains many integers whose prime factors are at most xϵx^\epsilon. The conjecture is stated as open in the source.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Shanta Laishram and Ram Murty, “Grimm's Conjecture and Smooth Numbers”, arXiv:1306.0765 (2013).

Solutions 0

No solutions have been posted yet.