ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let g(θ)g(\theta) be the least exponent such that, for some c1,c2>0c_1,c_2>0, every interval of the form

[x−c1xg(θ),x+c1xg(θ)][x-c_1x^{g(\theta)},x+c_1x^{g(\theta)}]

contains an integer n=a1b1=a2b2n=a_1b_1=a_2b_2, where

a1<a2≤b2<b1a_1<a_2\leq b_2<b_1

and all four integers lie in

[x1/2−c2xθ,x1/2+c2xθ][x^{1/2}-c_2x^\theta,x^{1/2}+c_2x^\theta]

and 0≤θ<1/20\leq\theta<1/2; the constants c1c_1 and c2c_2 may depend on θ\theta. The double almost-square exponent conjecture. For 1/4≤θ<1/21/4\leq\theta<1/2,

g(θ)=1−2θ.g(\theta)=1-2\theta.

The conjecture is motivated by the proved lower bound g(θ)≥1−2θg(\theta)\geq1-2\theta and the upper bound g(θ)≤1−θg(\theta)\leq1-\theta for 1/4≤θ≤1/31/4\leq\theta\leq1/3; no resolution is supplied here.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.